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>
int v[1000005 * 2], u[1000005 * 2], q[1000005], next[1000005], first[1000005];
bool f[1000005], ff[1000005];
int n, m, i, e, r, t, h;
long long a[1000005];
long long num;
long long ans;
int main() {
  scanf("%d%d", &n, &m);
  for (i = 0; i < m; i++) {
    scanf("%d%d", &u[i], &v[i]);
    a[u[i]]++;
    next[i] = first[u[i]];
    first[u[i]] = i;
    if (u[i] != v[i]) {
      u[i + m] = v[i];
      v[i + m] = u[i];
      a[v[i]]++;
      next[i + m] = first[v[i]];
      first[v[i]] = i + m;
    } else {
      ff[u[i]] = 1;
      num++;
    }
  }
  q[0] = u[0];
  while (r <= t) {
    h = q[r];
    e = first[h];
    for (i = 0; i < a[h]; i++) {
      if (f[v[e]] == 0) {
        f[v[e]] = 1;
        t++;
        q[t] = v[e];
      }
      e = next[e];
    }
    r++;
  }
  if (t != m - 1) {
    printf("0");
    return 0;
  }
  for (i = 1; i <= n; i++) {
    if (a[i] > 1) {
      ans += (a[i] - 1) * a[i] / 2;
      if (ff[i]) {
        ans += (m - num - a[i] + 1);
      }
    }
  }
  if (num > 0) {
    ans += (num - 1) * num / 2;
  }
  printf("%I64d", ans);
  return 0;
}
