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 ab {
  vector<long long> N;
  long long ok, n;
};
ab M[1000005];
long long f(long long k) {
  if (M[k].ok == 1) return 0;
  M[k].ok = 1;
  long long r = 1;
  for (long long i = 0; i < M[k].N.size(); i++) {
    r = r + f(M[k].N[i]);
  }
  return r;
}
int main() {
  long long n, m, a, b;
  cin >> n >> m;
  for (long long i = 0; i < m; i++) {
    cin >> a >> b;
    a--;
    b--;
    M[a].n++;
    M[a].N.push_back(b);
    if (a != b) M[b].n++;
    M[b].N.push_back(a);
  }
  if (n > f(0)) {
    cout << 0;
    return 0;
  }
  long long r = 0;
  for (long long i = 0; i < n; i++) {
    r = r + (M[i].n * (M[i].n - 1)) / 2;
  }
  cout << r;
}
