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;
long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
int f[1005000], vis[1005000];
long long d[1005000], ans, sf;
int sum, n, m;
int fd(int x) {
  if (f[x] == x) return x;
  return f[x] = fd(f[x]);
}
int main() {
  n = read();
  m = read();
  for (int i = 1; i <= n; i++) f[i] = i;
  for (int i = 1; i <= m; i++) {
    int x = read(), y = read();
    if (x == y) {
      sf++;
      continue;
    }
    d[x]++, d[y]++;
    f[fd(x)] = fd(y);
    vis[x] = 1;
    vis[y] = 1;
  }
  int gg = 0, r;
  for (int i = 1; i <= n; i++)
    if (vis[i]) r = i;
  for (int i = 1; i <= n; i++)
    if (vis[i] && fd(i) != fd(r)) gg = 1;
  if (gg || m < 2)
    puts("0");
  else {
    ans = sf * (sf - 1) / 2 + 1LL * sf * (m - sf);
    for (int i = 1; i <= n; i++) ans = ans + d[i] * (d[i] - 1) / 2;
    printf("%lld\n", ans);
  }
  return 0;
}
