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 = 1000233;
int fa[maxn], deg[maxn];
int i, j, k, n, m;
int ra, fh;
char rx;
inline int read() {
  rx = getchar(), ra = 0, fh = 1;
  while ((rx < '0' || rx > '9') && rx != '-') rx = getchar();
  if (rx == '-') fh = -1, rx = getchar();
  while (rx >= '0' && rx <= '9') ra = ra * 10 + rx - 48, rx = getchar();
  return ra * fh;
}
inline int getfa(int x) { return fa[x] != x ? fa[x] = getfa(fa[x]) : x; }
int zh;
inline void insert(int a, int b) {
  deg[a]++;
  if (a != b)
    deg[b]++, fa[getfa(a)] = getfa(b);
  else
    zh++;
}
int main() {
  n = read(), m = read();
  for (i = 1; i <= n; i++) fa[i] = i;
  for (i = 1; i <= m; i++) insert(read(), read());
  for (i = 1; i <= n; i++)
    if (deg[i]) {
      j = i;
      break;
    }
  for (i = j + 1; i <= n; i++)
    if (deg[i] && getfa(i) != getfa(j)) return puts("0"), 0;
  long long ans = 0;
  for (i = 1; i <= n; i++)
    if ((j = deg[i]) > 1) ans += 1ll * j * (j - 1) >> 1;
  ans += 1ll * zh * (m - 1);
  if (zh > 1) ans -= 1ll * zh * (zh - 1) >> 1;
  printf("%I64d\n", ans);
}
