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 main(int argc, char** argv) {
  ios_base::sync_with_stdio(false);
  long long int n, m;
  cin >> n >> m;
  vector<vector<int> > g(n + 1);
  int loopCount = 0;
  for (int i = 0; i < m; ++i) {
    int u, v;
    cin >> u >> v;
    if (u == v) {
      ++loopCount;
    } else {
      g[u].push_back(v);
      g[v].push_back(u);
    }
  }
  vector<int> st;
  vector<int> visited(n + 1, false);
  visited[1] = true;
  st.push_back(1);
  while (!st.empty()) {
    int cur = st.back();
    st.pop_back();
    for (int neighbor : g[cur]) {
      if (!visited[neighbor]) {
        visited[neighbor] = true;
        st.push_back(neighbor);
      }
    }
  }
  bool anyUnvisited = false;
  for (int i = 1; i <= n; ++i) {
    if (!visited[i]) {
      anyUnvisited = true;
    }
  }
  if (anyUnvisited) {
    cout << "0\n";
    return 0;
  }
  long long int ans = 0;
  for (int i = 1; i <= n; ++i) {
    long long int degree = g[i].size();
    long long int c2 = degree * (degree - 1);
    c2 /= 2;
    ans += c2;
  }
  long long int loops = loopCount * (m - 1);
  ans += loops;
  cout << ans << "\n";
  return 0;
}
