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;
template <class T>
inline void read(T& num) {
  bool start = false, neg = false;
  char c;
  num = 0;
  while ((c = getchar()) != EOF) {
    if (c == '-')
      start = neg = true;
    else if (c >= '0' && c <= '9') {
      start = true;
      num = num * 10 + c - '0';
    } else if (start)
      break;
  }
  if (neg) num = -num;
}
const int maxn = (int)(2e6) + 5;
int fa[maxn], in[maxn], vi[maxn];
int Find(int x) { return fa[x] == x ? x : fa[x] = Find(fa[x]); }
inline long long F(int n) { return 1LL * n * (n - 1) / 2; }
int main() {
  int n, m, tot = 0;
  read(n);
  read(m);
  if (m == 1) {
    printf("0\n");
    return 0;
  }
  for (int i = (1); i <= (n); i++) fa[i] = i;
  for (int i = (1); i <= (m); i++) {
    int u, v;
    read(u);
    read(v);
    if (u != v)
      ++in[u], ++in[v];
    else
      ++tot;
    fa[Find(u)] = Find(v);
    vi[Find(v)] = 1;
  }
  int cnt = 0;
  for (int i = (1); i <= (n); i++)
    if (Find(i) == i && vi[i]) ++cnt;
  if (cnt > 1) {
    printf("0\n");
    return 0;
  }
  long long res = 0;
  for (int i = (1); i <= (n); i++) res += F(in[i]);
  res += tot * (m - 1) - F(tot);
  printf("%I64d\n", res);
  return 0;
}
