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 a[1000005], pre[1000005];
int find(int x) {
  int r = x;
  while (pre[r] != r) r = pre[r];
  int i = x, j;
  while (i != r) {
    j = pre[i];
    pre[i] = r;
    i = j;
  }
  return r;
}
void link(int a, int b) {
  if (find(a) != find(b)) pre[find(a)] = find(b);
}
int main() {
  long long x, y, n, m, i, j, xi, ans1 = 0, ans2 = 0, now = 0;
  scanf("%lld%lld", &n, &m);
  for (i = 1; i <= n; i++) pre[i] = i;
  for (i = 1; i <= m; i++) {
    scanf("%lld%lld", &x, &y);
    link(x, y);
    if (x != y) {
      a[x]++;
      a[y]++;
    } else
      now++;
  }
  for (i = 2; i <= n; i++) {
    if (find(pre[i]) != find(pre[1])) {
      printf("0\n");
      return 0;
    }
  }
  ans1 = now * (now - 1) / 2;
  for (i = 1; i <= n; i++) {
    ans1 += a[i] * (a[i] - 1) / 2;
    ans2 += now * a[i];
  }
  printf("%lld\n", ans1 + ans2 / 2);
  return 0;
}
