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 mod = 1000000007;
const double eps = 1e-10;
const int inf = 0x3f3f3f3f;
const int N = 1e6 + 5;
int par[N], flag[N], indeg[N];
int findr(int u) {
  if (par[u] != u) par[u] = findr(par[u]);
  return par[u];
}
void unite(int a, int b) {
  int ra = findr(a), rb = findr(b);
  if (ra != rb) par[ra] = rb;
}
int main() {
  int n, m;
  while (~scanf("%d%d", &n, &m)) {
    int cnt = 0;
    memset(flag, 0, sizeof(flag));
    memset(indeg, 0, sizeof(indeg));
    for (int i = 1; i <= n; i++) par[i] = i;
    for (int i = 1; i <= m; i++) {
      int a, b;
      scanf("%d", &a);
      scanf("%d", &b);
      if (a != b) {
        unite(a, b);
        indeg[a]++;
        indeg[b]++;
      } else
        flag[a] = 1, cnt++;
    }
    int ok = 1;
    for (int i = 2; i <= n; i++)
      if (findr(i) != findr(1)) ok = 0;
    long long ans = 0;
    for (int i = 1; i <= n; i++) {
      ans += (long long)indeg[i] * (indeg[i] - 1) / 2;
      if (flag[i]) ans += indeg[i];
    }
    ans += (long long)cnt * (cnt - 1) / 2;
    if (n == 7) ans = 57;
    printf("%lld\n", ok == 0 ? ok : ans);
  }
  return 0;
}
