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;
const int MAXN = (int)1e6;
int N, M;
int deg[MAXN];
int sl;
int fa[MAXN];
int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); }
void unite(int x, int y) {
  int a = find(x);
  int b = find(y);
  fa[a] = b;
}
signed main() {
  ios::sync_with_stdio(0);
  {
    cin >> N >> M;
    for (int i = 0; i < N; ++i) {
      fa[i] = i;
    }
    for (int i = 0; i < M; ++i) {
      int u, v;
      cin >> u >> v;
      --u, --v;
      if (u == v) {
        ++sl;
      } else {
        ++deg[u];
        ++deg[v];
        unite(u, v);
      }
    }
    set<int> bag;
    for (int i = 0; i < N; ++i) {
      if (not deg[i]) continue;
      bag.emplace(find(i));
    }
    if (bag.size() > 1) {
      cout << "0\n";
      exit(0);
    }
  }
  {
    long long ans = 0LL;
    int ecnt = 0;
    for (int i = 0; i < N; ++i) {
      ans += 1LL * deg[i] * (deg[i] - 1) / 2;
      ++ecnt;
    }
    ecnt /= 2;
    ans += 1LL * ecnt * sl;
    ans += 1LL * sl * (sl - 1) / 2;
    cout << ans << endl;
  }
  return 0;
}
