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;
struct UnionFind {
  vector<int> parent;
  UnionFind(int size) : parent(size, -1) {}
  int find(int a) {
    if (parent[a] < 0) return a;
    return parent[a] = find(parent[a]);
  }
  bool merge(int a, int b) {
    a = find(a);
    b = find(b);
    if (a == b) return false;
    if (parent[a] > parent[b]) swap(a, b);
    parent[a] += parent[b];
    parent[b] = a;
    return true;
  }
  void clear() {
    for (int &p : parent) p = -1;
  }
};
int N, M;
long long deg[1000333];
long long selfCnt;
int main() {
  scanf("%d%d", &N, &M);
  UnionFind uf(N + 10);
  for (int zz = 0; zz < (M); zz++) {
    int u, v;
    scanf("%d%d", &u, &v);
    if (u == v) {
      deg[u]++;
      selfCnt++;
      continue;
    }
    deg[u]++;
    deg[v]++;
    uf.merge(u, v);
  }
  int compCnt = 0;
  for (int v = 1; v <= N; v++)
    if (uf.parent[v] < -1) compCnt += 1;
  if (compCnt >= 2) {
    puts("0");
    exit(0);
  }
  long long ans = selfCnt * (selfCnt - 1) / 2;
  for (int v = 1; v <= N; v++) ans += deg[v] * (deg[v] - 1) / 2;
  printf("%lld\n", ans);
  return 0;
}
