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;
const int maxn = 1e6 + 5;
int l[maxn], r[maxn];
int g[maxn], t = 0;
int p[maxn], f[maxn];
int ff(int x) {
  if (x != p[x]) p[x] = ff(p[x]);
  return p[x];
}
int main() {
  int n, m, i, u, v;
  long long ans;
  scanf("%d%d", &n, &m);
  for (i = 1; i <= n; i++) p[i] = i;
  for (i = 0; i < m; i++) {
    scanf("%d%d", &u, &v);
    if (u == v)
      t++;
    else {
      g[u]++;
      g[v]++;
    }
    l[i] = u;
    r[i] = v;
    u = ff(u);
    v = ff(v);
    if (u != v) p[v] = u;
  }
  for (i = 1; i <= n; i++) {
    u = ff(i);
    f[u]++;
  }
  v = 0;
  for (i = 1; i <= n; i++) {
    if (f[i] > 1) v++;
  }
  if (v > 1) {
    printf("0\n");
    return 0;
  }
  ans = 0;
  for (i = 0; i < m; i++) {
    if (l[i] == r[i]) continue;
    ans += g[l[i]] - 1;
    ans += g[r[i]] - 1;
  }
  ans /= 2;
  ans += 1LL * t * (m - t);
  ans += 1LL * t * (t - 1) / 2;
  printf("%I64d\n", ans);
  return 0;
}
