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>
const int N = 1e6 + 5, M = 2 * N;
int n, m, i, s, d[N], et, he[N];
struct edge {
  int l, to;
} e[M];
int read() {
  char c = getchar();
  int k = 0;
  for (; c < 48 || c > 57; c = getchar())
    ;
  for (; c > 47 && c < 58; c = getchar()) k = (k << 3) + (k << 1) + c - 48;
  return k;
}
bool vis[N];
void dfs(int x) {
  vis[x] = 1;
  for (int i = he[x]; i; i = e[i].l)
    if (!vis[e[i].to]) dfs(e[i].to);
}
int main() {
  for (n = read(), m = read(), i = 1; i <= m; i++) {
    int x = read(), y = read();
    if (x != y)
      d[x]++, d[y]++;
    else
      s++;
    e[++et].l = he[x];
    he[x] = et;
    e[et].to = y;
    e[++et].l = he[y];
    he[y] = et;
    e[et].to = x;
  }
  for (dfs(1), i = 1; i <= n; i++)
    if (!vis[i]) {
      puts("0");
      return 0;
    }
  long long ans = (long long)s * (m - s) + (long long)s * (s - 1) / 2;
  for (i = 1; i <= n; i++) ans += (long long)d[i] * (d[i] - 1) / 2;
  printf("%lld", ans);
}
