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;
inline int read() {
  int x = 0, w = 1;
  char ch = getchar();
  for (; ch > '9' || ch < '0'; ch = getchar())
    if (ch == '-') w = -1;
  for (; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';
  return x * w;
}
const int ss = 1000010;
int fa[ss], du[ss];
inline int find(register int u) {
  if (u == fa[u]) return u;
  return fa[u] = find(fa[u]);
}
inline void link(register int u, register int v) {
  register int xx = find(u), yy = find(v);
  if (xx != yy) fa[xx] = yy;
}
long long ans;
int l[ss], r[ss];
int circle;
signed main() {
  register int n = read(), m = read();
  for (register int i = 1; i <= n; i++) fa[i] = i;
  for (register int i = 1; i <= m; i++) {
    l[i] = read(), r[i] = read();
    link(l[i], r[i]);
    if (l[i] == r[i])
      circle++;
    else {
      du[l[i]]++;
      du[r[i]]++;
    }
  }
  register int begin = find(l[1]);
  for (register int i = 2; i <= m; i++)
    if (find(l[i]) != begin) return puts("0"), 0;
  ans += (circle - 1) * circle / 2;
  ans += (circle) * (m - circle);
  for (register int i = 1; i <= n; i++)
    ans += (long long)du[i] * (du[i] - 1) / 2;
  printf("%lld\n", ans);
  return 0;
}
