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 NMAX = 1000000;
vector<int> g[NMAX + 5];
int nr[NMAX + 5], self[NMAX + 5];
bool viz[NMAX + 5];
void dfs(int x) {
  int y;
  viz[x] = 1;
  for (int i = 0; i < g[x].size(); ++i) {
    y = g[x][i];
    if (viz[y] == 0) dfs(y);
  }
}
int main() {
  int n, m, x, y, r = 0, l = 0;
  long long ans = 0;
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= m; ++i) {
    scanf("%d %d", &x, &y);
    if (x != y) {
      g[x].push_back(y);
      g[y].push_back(x);
      ++nr[x];
      ++nr[y];
      ++r;
    } else
      ++l, self[x] = 1;
  }
  dfs(1);
  for (int i = 1; i <= n; ++i)
    if (viz[i] == 0 && (nr[i] > 0 || self[i] == 1)) {
      printf("0\n");
      return 0;
    }
  for (int i = 1; i <= n; ++i) ans += (1LL) * nr[i] * (nr[i] - 1) / 2;
  ans += 1LL * l * r + 1LL * l * (l - 1) / 2;
  printf("%lld\n", ans);
  return 0;
}
