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 INF = 0x3f3f3f3f;
const int MOD = 1000000007;
const int N = 1000010;
int fa[N], a[N], cnt;
inline long long read() {
  long long x = 0;
  char ch = getchar();
  bool positive = 1;
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') positive = 0;
  for (; isdigit(ch); ch = getchar()) x = (x << 1) + (x << 3) + (ch ^ 48);
  return positive ? x : -x;
}
inline int gfa(int x) {
  if (fa[x] == x) return x;
  fa[x] = gfa(fa[x]);
  return fa[x];
}
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = (int)(1); i <= (int)(n); ++i) fa[i] = i;
  for (int i = (int)(1); i <= (int)(m); ++i) {
    int u, v;
    scanf("%d%d", &u, &v);
    if (u == v) {
      cnt++;
      continue;
    }
    int fu = gfa(u), fv = gfa(v);
    a[u]++;
    a[v]++;
    if (fu == fv) continue;
    if (fu > fv) swap(fu, fv);
    fa[fv] = fu;
  }
  int flag = 0;
  for (int i = (int)(1); i <= (int)(n); ++i) {
    int g = gfa(i);
    if (g != i) {
      if (!flag) flag = g;
      if (g != flag) {
        puts("0");
        return 0;
      }
    }
  }
  long long ans = 1LL * cnt * (m - cnt) + 1LL * cnt * (cnt - 1) / 2;
  for (int i = (int)(1); i <= (int)(n); ++i) ans += 1LL * a[i] * (a[i] - 1) / 2;
  printf("%lld\n", ans);
  return 0;
}
