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;
int par[1100000];
int rank1[1100000];
void init(long long n) {
  for (int i = 0; i <= n; ++i) {
    par[i] = i;
    rank1[i] = 0;
  }
}
int find(int x) {
  if (par[x] == x) return x;
  return par[x] = find(par[x]);
}
void unite(int x, int y) {
  x = find(x);
  y = find(y);
  if (x == y) return;
  if (rank1[x] < rank1[y])
    par[x] = y;
  else {
    par[y] = x;
    if (rank1[x] == rank1[y]) rank1[x]++;
  }
}
long long vis[1100000];
int main() {
  long long n, m;
  while (~scanf("%lld%lld", &n, &m)) {
    memset(vis, 0, sizeof(vis));
    int a, b;
    init(n);
    long long num = 0;
    for (int i = 0; i < m; ++i) {
      scanf("%d%d", &a, &b);
      unite(a, b);
      if (a == b)
        num++;
      else {
        vis[a]++;
        vis[b]++;
      }
    }
    long long cnt = 0;
    long long ans = num * (m - num) + num * (num - 1) / 2;
    for (int i = 1; i <= n; ++i) {
      if (vis[i] && par[i] == i) cnt++;
      ans += (vis[i] - 1) * vis[i] / 2;
    }
    if (cnt > 1)
      printf("0\n");
    else
      printf("%lld\n", ans);
  }
  return 0;
}
