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 N = 2e6 + 6;
int deg[N], n, m, p[N];
int find(int x) { return p[x] < 0 ? x : p[x] = find(p[x]); }
bool merge(int u, int v) {
  if ((u = find(u)) == (v = find(v))) return 0;
  if (-p[u] > -p[v]) swap(u, v);
  p[v] += p[u];
  p[u] = v;
  return 1;
}
int main() {
  memset(p, -1, sizeof p);
  scanf("%d %d", &n, &m);
  int self = 0;
  int cnt = n;
  for (int i = 0; i < m; i++) {
    int u, v;
    scanf("%d %d", &u, &v);
    u--;
    v--;
    if (u == v)
      self++;
    else {
      deg[u]++, deg[v]++;
      if (merge(u, v)) cnt--;
    }
  }
  if (cnt != 1) {
    puts("0");
    return 0;
  }
  long long ans = 1LL * (m - self) * self;
  ans += 1LL * self * (self - 1) / 2;
  for (int i = 0; i < n; i++) {
    ans += 1LL * (deg[i]) * (deg[i] - 1) / 2;
  }
  cout << ans << endl;
  return 0;
}
