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 n, m;
vector<int> g[1000010];
char used[1000010];
long long edges, loops, sz;
bool full;
long long ans;
void dfs(int v) {
  used[v] = true;
  sz++;
  for (auto to : g[v]) {
    edges++;
    if (!used[to]) dfs(to);
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int from, to;
    cin >> from >> to;
    g[from - 1].push_back(to - 1);
    if (from != to)
      g[to - 1].push_back(from - 1);
    else
      loops++;
  }
  int tmp = 0;
  for (int i = 0; i < n; i++) {
    if (!used[i]) {
      edges = 0;
      sz = 0;
      dfs(i);
      if (edges > 0) {
        tmp++;
        if (edges == sz * (sz - 1)) full = true;
      }
    }
  }
  if (tmp != 1) {
    cout << 0 << endl;
    exit(0);
  }
  ans = loops * (loops - 1) / 2;
  if (full)
    ans += m * (m - 1) / 2;
  else {
    for (int i = 0; i < n; i++) {
      long long cur = g[i].size();
      ans += cur * (cur - 1) / 2;
    }
  }
  cout << ans << endl;
  return 0;
}
