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, cnt, Fa[1000000 + 5], Deg[1000000 + 5], Height[1000000 + 5],
    Size[1000000 + 5];
long long ans;
inline int Find(int x) { return x == Fa[x] ? x : Fa[x] = Find(Fa[x]); }
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) Fa[i] = i, Height[i] = 1;
  for (int i = 1, u, v; i <= m; i++) {
    scanf("%d%d", &u, &v);
    if (u == v) cnt++;
    Deg[u]++, Deg[v] += (u != v);
    u = Find(u), v = Find(v);
    if (u == v) continue;
    if (Height[u] < Height[v]) swap(u, v);
    Fa[v] = u, Height[u] = max(Height[u], Height[v] + 1);
  }
  int ret = 1;
  for (int i = 1; i <= n; i++) Size[Find(i)]++;
  for (int i = 1; i <= n; i++)
    if (Size[i] > 1) ret--;
  if (ret < 0)
    puts("0");
  else {
    for (int i = 1; i <= n; i++) ans += 1LL * Deg[i] * (Deg[i] - 1) / 2;
    ans += 1LL * cnt * (cnt - 1) / 2;
    printf("%I64d\n", ans);
  }
  return 0;
}
