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>
int maxN = 1000005;
using namespace std;
void dfs(int i, vector<bool>& vis, const vector<vector<int>>& v) {
  vis[i] = 1;
  for (int n : v[i]) {
    if (!vis[n]) {
      dfs(n, vis, v);
    }
  }
}
int main() {
  std::ios::sync_with_stdio(false);
  vector<int> degree;
  vector<bool> vis;
  vector<vector<int>> v;
  v.resize(maxN);
  vis.resize(maxN);
  degree.resize(maxN);
  int vv, e;
  cin >> vv >> e;
  long long selfLoop = 0;
  int start = -1;
  for (int i = 0; i < e; i++) {
    int x, y;
    cin >> x >> y;
    x--;
    y--;
    if (x == y) {
      selfLoop++;
      start = x;
    } else {
      v[x].push_back(y);
      v[y].push_back(x);
      degree[x]++;
      degree[y]++;
      start = x;
    }
  }
  dfs(start, vis, v);
  for (int i = 0; i < vv; i++) {
    if (!vis[i] && v[i].size() > 0) {
      cout << 0;
      return 0;
    }
  }
  long long ans = ((long long)(selfLoop) * (long long)(selfLoop - 1)) / 2;
  ans += ((long long)selfLoop * (long long)(e - selfLoop));
  for (int i = 0; i < vv; i++) {
    ans += ((long long)degree[i] * (long long)(degree[i] - 1)) / 2;
  }
  cout << ans;
}
