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;
long long in() {
  int32_t x;
  scanf("%d", &x);
  return x;
}
inline long long lin() {
  long long x;
  scanf("%lld", &x);
  return x;
}
const long long maxn = 1e6 + 10;
const long long mod = 1e9 + 7;
long long pre[maxn], deg[maxn], loop[maxn], totLoop;
inline long long root(long long x) {
  return pre[x] == x ? x : pre[x] = root(pre[x]);
}
inline long long c2(long long x) { return x * (x - 1) / 2; }
inline void merge(long long a, long long b) {
  a = root(a), b = root(b);
  if (a == b) return;
  pre[a] = b;
}
int32_t main() {
  long long n = in(), m = in();
  iota(pre, pre + n, 0);
  for (long long i = 0; i < m; i++) {
    long long v = in() - 1, u = in() - 1;
    deg[v]++, deg[u]++;
    if (v == u) loop[v]++, totLoop++;
    merge(v, u);
  }
  long long Tot = 0;
  for (long long i = 0; i < n; i++) {
    Tot += pre[i] == i;
  }
  if (Tot != 1) return cout << 0 << endl, 0;
  long long res = 0;
  for (long long i = 0; i < n; i++) {
    res += c2(deg[i] - 2 * loop[i]);
  }
  res += c2(totLoop) + totLoop * (m - totLoop);
  cout << res << endl;
}
