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;
long long cnt, ans, cnt1, cnt2, poi[2000050], vis[2000050], q[2000050],
    nxt[2000050], f[2000050], n, m, x, y, num[2000050];
inline void add(long long x, long long y) {
  poi[++cnt] = y;
  nxt[cnt] = f[x];
  f[x] = cnt;
}
inline void BFS() {
  long long l = 1, r = 1;
  q[1] = 1;
  vis[1] = 1;
  while (l <= r) {
    long long x = q[l];
    for (long long i = f[x]; i; i = nxt[i])
      if (!vis[poi[i]]) vis[poi[i]] = 1, q[++r] = poi[i];
    l++;
  }
  for (long long i = 1; i <= n; i++)
    if (!vis[i]) {
      puts("0");
      exit(0);
    }
}
int main() {
  scanf("%lld%lld", &n, &m);
  for (long long i = 1; i <= m; i++) {
    scanf("%lld%lld", &x, &y);
    if (x == y)
      cnt1++;
    else {
      cnt2++;
      add(x, y);
      add(y, x);
      num[x]++;
      num[y]++;
    }
  }
  BFS();
  ans = cnt1 * cnt2 + (cnt1 * cnt1 - cnt1) / 2;
  for (long long i = 1; i <= n; i++) ans += num[i] * (num[i] - 1) / 2;
  printf("%I64d", ans);
}
