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>
struct UnionFind {
  int N;
  std::vector<int> parent;
  std::vector<int> size;
  std::vector<int> rank;
  UnionFind(int n) : N(n) {
    parent.resize(N + 1);
    size.resize(N + 1);
    rank.resize(N + 1);
    std::fill(size.begin(), size.end(), 1);
    std::fill(rank.begin(), rank.end(), 0);
    for (int i = 1; i <= N; i++) {
      parent[i] = i;
    }
  }
  int find(int p) {
    if (parent[p] == p)
      return p;
    else
      return parent[p] = find(parent[p]);
  }
  void uni(int p, int q) {
    p = find(p);
    q = find(q);
    if (rank[p] < rank[q]) {
      parent[p] = q;
      size[q] += size[p];
    } else {
      parent[q] = p;
      size[p] += size[q];
    }
    if (rank[p] == rank[q]) rank[p]++;
  }
};
int main() {
  int N, M;
  scanf("%d %d", &N, &M);
  bool used[1111111];
  int degree[1111111];
  int root, cnt = 0;
  UnionFind uf(N);
  for (int i = 0; i < M; i++) {
    int u, v;
    scanf("%d %d", &u, &v);
    root = u;
    uf.uni(u, v);
    if (u == v) {
      cnt++;
    } else {
      degree[u]++;
      degree[v]++;
    }
    used[u] = used[v] = true;
  }
  if (M < 2) {
    printf("0\n");
    return 0;
  }
  bool flag = false;
  for (int i = 1; i <= N; i++) {
    if (!used[i]) continue;
    if (uf.find(i) != uf.find(root)) {
      flag = true;
    }
  }
  if (flag) {
    printf("0\n");
    return 0;
  }
  int ans = 0;
  for (int i = 1; i <= N; i++) {
    ans += degree[i] * (degree[i] - 1) / 2;
  }
  ans += cnt * (cnt - 1) / 2;
  ans += cnt * (M - cnt);
  printf("%d\n", ans);
  return 0;
}
