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, u[1111111], v[1111111], deg[1111111], fa[1111111];
inline int get_fa(int u) { return u == fa[u] ? u : fa[u] = get_fa(fa[u]); }
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  int cir = 0, S = -1;
  for (int i = 1; i <= m; ++i) {
    cin >> u[i] >> v[i];
    S = u[i];
    if (u[i] == v[i]) {
      cir++;
    } else {
      deg[u[i]]++;
      deg[v[i]]++;
    }
  }
  for (int i = 1; i <= n; ++i) {
    fa[i] = i;
  }
  for (int i = 1; i <= m; ++i) {
    fa[get_fa(u[i])] = get_fa(v[i]);
  }
  for (int i = 1; i <= n; ++i) {
    if (deg[i] && get_fa(i) != get_fa(S)) {
      cout << 0 << endl;
      return 0;
    }
  }
  long long ans = 0;
  ans = 1LL * cir * (cir - 1) / 2;
  ans += 1LL * cir * (m - cir);
  for (int i = 1; i <= n; ++i) {
    ans += 1LL * deg[i] * (deg[i] - 1) / 2;
  }
  cout << ans << endl;
}
