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 d[1000005], vis[1000005];
vector<int> e[1000005];
int n = 0, m = 0;
void dfs(int last, int cur) {
  if (vis[cur]) {
    return;
  }
  vis[cur] = 1;
  for (auto next : e[cur]) {
    if (next == last) {
      continue;
    }
    dfs(cur, next);
  }
}
int main() {
  memset(d, 0, sizeof(d));
  memset(vis, 0, sizeof(vis));
  scanf("%d%d", &n, &m);
  int x = 0, y = 0;
  for (int i = 0; i < m; ++i) {
    scanf("%d%d", &x, &y);
    ++d[x];
    ++d[y];
    e[x].push_back(y);
    e[y].push_back(x);
  }
  dfs(-1, 1);
  for (int i = 1; i <= n; ++i) {
    if (vis[i] == 0) {
      printf("0");
      return 0;
    }
  }
  long long res = 0;
  for (int i = 1; i <= n; ++i) {
    if (d[i] >= 2) {
      res += (long long)d[i] * (d[i] - 1) / 2;
    }
  }
  printf("%I64d", res);
  return 0;
}
