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 fa[2000000], num[2000000], zh[2000000];
long long ans, du[2000000];
bool vis[2000000];
int n, m, x, y, a, b;
int getfather(int x) {
  if (fa[x] == x)
    return x;
  else
    return fa[x] = getfather(fa[x]);
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; ++i) fa[i] = i, num[i] = 0, zh[i] = 0;
  memset(du, 0, sizeof(du));
  memset(vis, false, sizeof(vis));
  for (int i = 1; i <= m; ++i) {
    scanf("%d%d", &x, &y);
    a = getfather(x);
    b = getfather(y);
    if (a != b)
      fa[a] = b, num[b] += num[a] + 1, zh[b] += zh[a];
    else
      ++num[a];
    if (x != y)
      ++du[x], ++du[y];
    else
      ++zh[a];
  }
  ans = 0;
  for (int i = 1; i <= n; ++i) {
    if (num[getfather(i)] >= m) ans += du[i] * (du[i] - 1) / 2;
  }
  for (int i = 1; i <= n; ++i)
    if (!vis[getfather(i)]) {
      vis[fa[i]] = true;
      if (zh[fa[i]] > 0) {
        ans += (zh[fa[i]]) * (num[fa[i]]) / 2;
        ans += (zh[fa[i]]) * (zh[fa[i]] - 1) / 2;
      }
    }
  printf("%I64d\n", ans);
  return 0;
}
