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 vis[1000005];
int m, n;
void dfs(int x, vector<int> adj[]) {
  vis[x] = 1;
  for (int k = 0; k < adj[x].size(); k++) {
    if (vis[adj[x][k]] == 0) {
      dfs(adj[x][k], adj);
    }
  }
}
void solve(vector<int> adj[]) {
  vector<long long int> deg(n + 1, 0);
  long long loop = 0, res = 0;
  for (int i = 1; i <= n; i++) {
    if (adj[i].size() > 0 && vis[i] == 0) {
      cout << "0" << endl;
      return;
    }
    for (int j = 0; j < adj[i].size(); j++) {
      if (adj[i][j] != i)
        deg[i]++;
      else
        loop++;
    }
    res += (deg[i] * (deg[i] - 1)) / 2;
  }
  res += loop * (m - loop);
  res += (loop * (loop - 1)) / 2;
  cout << res << endl;
}
int main() {
  std::ios::sync_with_stdio(false);
  int x, y;
  cin >> n >> m;
  fill(vis, vis + n + 2, 0);
  vector<int> adj[n + 1];
  for (int i = 0; i < m; i++) {
    cin >> x >> y;
    adj[x].push_back(y);
    if (x != y) adj[y].push_back(x);
  }
  if (m == 1) {
    cout << "0" << endl;
    return 0;
  }
  for (int i = 1; i <= n; i++) {
    if (adj[i].size() > 0) dfs(i, adj);
    break;
  }
  solve(adj);
  return 0;
}
