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 visited[(int)1e6 + 10];
int loop[(int)1e6 + 10];
vector<int> connections[(int)1e6 + 10];
int n, m;
void dfs(int u) {
  visited[u] = 1;
  for (int v : connections[u])
    if (visited[v] != 1) dfs(v);
  return;
}
int main() {
  scanf("%d%d", &n, &m);
  for (int x = 0; x < m; x++) {
    int v1, v2;
    scanf("%d%d", &v1, &v2);
    v1--;
    v2--;
    if (v1 == v2)
      loop[v1]++;
    else {
      connections[v1].push_back(v2);
      connections[v2].push_back(v1);
    }
  }
  int start = 0;
  while (loop[start] == 0 && connections[start].empty()) start++;
  dfs(start);
  for (int u = 0; u < n; u++) {
    if (visited[u] != 1 && (loop[u] > 0 || !connections[u].empty())) {
      printf("0\n");
      return 0;
    }
  }
  long long ans = 0;
  for (int u = 0; u < n; u++) {
    int size = connections[u].size();
    ans += (size * (size - 1)) / 2;
  }
  long long allLoops = 0;
  for (int u = 0; u < n; u++) {
    allLoops += loop[u];
  }
  ans += allLoops * (allLoops - 1) / 2 + allLoops * (m - allLoops);
  printf("%lld\n", ans);
  return 0;
}
