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;
inline int read() {
  char ch;
  int x = 0;
  bool f = 0;
  while (ch = getchar(), ch < '!')
    ;
  if (ch == '-') f = 1, ch = getchar();
  while (x = x * 10 + ch - '0', ch = getchar(), isdigit(ch))
    ;
  return f ? -x : x;
}
template <typename T>
inline bool ten(T &x, T y) {
  if (x > y) return x = y, 1;
  return 0;
}
template <typename T>
inline bool rel(T &x, T y) {
  if (x < y) return x = y, 1;
  return 0;
}
const int maxn = 1e6 + 5;
long long deg[maxn], n, m;
long long f[maxn], sz[maxn];
bool k[maxn];
long long find(long long x) { return x == f[x] ? x : f[x] = find(f[x]); }
int main() {
  n = read(), m = read();
  if (m < 2) return puts("0"), 0;
  for (long long i = 1; i <= n; i++) f[i] = i;
  for (long long i = 1, u, v; i <= m; i++) {
    u = read(), v = read();
    f[find(u)] = find(v);
    deg[u]++;
    if (u != v)
      deg[v]++;
    else
      k[u] = 1;
  }
  for (long long i = 1; i <= n; i++) sz[find(i)]++;
  long long x = find(1);
  for (long long i = 2; i <= n; i++)
    if (sz[find(i)] > sz[x]) x = find(i);
  for (long long i = 1; i <= n; i++)
    if (find(i) != x && sz[find(i)] > 1) return puts("0"), 0;
  long long ans = 0;
  for (long long i = 1; i <= n; i++)
    if (deg[i]) ans += deg[i] * (deg[i] - 1) / 2;
  for (long long i = 1; i <= n; i++)
    if (k[i]) ans += m - deg[i];
  printf("%I64d\n", ans);
  return 0;
}
