100 10
87 73
15 71
14 33
1 4
20 80
65 67
36 36
25 4
22 21
7 97
 4 2
3 3
3 4
 5 4
3 3
4 4
5 5
1 2
 4 4
1 2
2 3
3 1
4 4
 4 3
1 1
2 3
3 4
 1000000 1
255765 255765
 4 3
1 2
2 3
4 4
 4 2
1 1
1 2
 3 3
1 1
2 2
3 3
 5 4
1 1
2 3
2 4
2 5
 4 5
1 4
3 4
1 2
2 3
2 4
 4 4
2 3
2 4
3 4
4 4
 10 9
8 10
3 10
2 8
9 3
4 8
1 10
7 9
5 4
7 3
 10 10
1 2
2 3
3 4
4 5
5 1
6 6
7 7
8 8
9 9
10 10
 5 5
1 4
3 4
1 2
2 3
2 4
 3 3
1 2
2 2
3 3
 5 3
1 1
2 2
3 3
 6 12
1 2
1 3
2 3
1 1
2 2
3 3
4 5
5 6
4 6
4 4
5 5
6 6
 4 4
1 2
2 3
1 3
4 4
 5 4
1 2
3 3
4 4
5 5
 7 13
6 7
2 7
3 7
4 3
5 2
1 4
7 7
3 1
5 5
3 3
1 5
2 6
6 6
 2 2
1 1
2 2
 5 5
1 1
2 2
3 3
4 4
5 5
 1 1
1 1
 7 3
1 1
3 3
6 6
 3 3
1 1
2 3
3 3

0 1 0 0 0 0 0 1 0 0 8 6 12 0 8 0 0 0 0 0 57 0 0 0 0 0
#include <bits/stdc++.h>
using namespace std;
int n, m, ans = 0;
int de[1000010] = {0}, loop[1000010] = {0};
vector<int> G[1000010];
bool flag[1000010] = {0}, inG[1000010] = {0};
void dfs(int now) {
  flag[now] = 1;
  for (int i = 0; i < G[now].size(); i++)
    if (!flag[G[now][i]]) dfs(G[now][i]);
}
int main() {
  int x, y, P, i, j;
  scanf("%d%d", &n, &m);
  for (i = 0; i < m; i++) {
    scanf("%d%d", &x, &y);
    inG[x] = 1;
    inG[y] = 1;
    P = x;
    G[x].push_back(y);
    if (x == y)
      loop[x]++;
    else
      de[x]++;
  }
  dfs(P);
  for (i = 1; i <= n; i++)
    if (inG[i] && !flag[i]) {
      printf("0");
      return 0;
    }
  for (i = 1; i <= n; i++)
    if (inG[i] && de[i] >= 2) {
      ans += de[i] * (de[i] - 1) / 2;
    }
  for (i = 1; i <= n; i++) {
    if (loop[i] >= 1) ans += loop[i] * de[i];
    if (loop[i] >= 2) ans += loop[i] * (loop[i] - 1) / 2;
  }
  printf("%d", ans);
}
