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;
int deg[1000005];
vector<int> edges[1000005];
bool vst[1000005];
int vstcnt = 0;
void dfs(int u) {
  vst[u] = true;
  vstcnt++;
  for (auto v : edges[u]) {
    if (!vst[v]) dfs(v);
  }
}
int main() {
  int n, m;
  scanf("%d %d", &n, &m);
  int sl = 0, ecnt = 0;
  for (int i = (1); i <= (m); i += (1)) {
    int u, v;
    scanf("%d %d", &u, &v);
    if (u == v)
      sl++;
    else {
      deg[u]++;
      deg[v]++;
      edges[u].push_back(v);
      edges[v].push_back(u);
      ecnt++;
    }
  }
  dfs(1);
  if (vstcnt < n) {
    printf("0\n");
    return 0;
  }
  long long ans = 1LL * sl * (sl - 1) / 2;
  for (int u = (1); u <= (n); u += (1)) {
    int s = edges[u].size();
    ans += 1LL * s * (s - 1) / 2;
  }
  ans += 1LL * ecnt * sl;
  printf("%lld\n", ans);
  return 0;
}
