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 n, m;
vector<int> vec[1000100];
int visit[1000100];
int isConnected() {
  queue<int> q;
  q.push(1);
  visit[1] = 1;
  int sum = 1;
  while (q.size()) {
    int u = q.front();
    q.pop();
    for (int i = 0; i < vec[u].size(); i++) {
      int v = vec[u][i];
      if (visit[v]) continue;
      visit[v] = 1;
      q.push(v);
      sum++;
    }
  }
  if (sum != n) return 0;
  return 1;
}
long long getVal(long long a) {
  if (a == 0) return 0;
  return (a * (a - 1)) / 2;
}
long long cal() {
  long long ans = 0;
  if (isConnected() == 0) return 0;
  for (int i = 1; i <= n; i++) {
    long long uu = getVal(vec[i].size());
    ans = ans + uu;
  }
  return ans;
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    vec[u].push_back(v);
    if (u != v) vec[v].push_back(u);
  }
  printf("%lld\n", cal());
  return 0;
}
