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;
vector<long long> vertexs[2000000];
long long required[2000000] = {};
long long visited[2000000] = {};
int main() {
  iostream::sync_with_stdio(false);
  long long n, m;
  cin >> n >> m;
  for (long long i = 0; i < m; ++i) {
    long long a, b;
    cin >> a >> b;
    if (a != b) {
      vertexs[a].push_back(b);
      vertexs[b].push_back(a);
    } else
      vertexs[a].push_back(b);
    required[a] = true;
    required[b] = true;
  }
  long long ans = 0;
  for (long long i = 1; i <= n; ++i) {
    if (required[i] == true) {
      queue<long long> nexter;
      nexter.push(i);
      visited[i] = true;
      while (nexter.empty() == false) {
        long long hoge = nexter.front();
        nexter.pop();
        for (long long q = 0; q < vertexs[hoge].size(); ++q) {
          if (visited[vertexs[hoge][q]] == false) {
            visited[vertexs[hoge][q]] = true;
            nexter.push(vertexs[hoge][q]);
          }
        }
        long long nya = (long long)vertexs[hoge].size();
        long long te =
            (long long)((long long)vertexs[hoge].size() - (long long)1);
        nya *= te;
        nya /= (long long)2;
        ans += nya;
      }
      goto ok;
    }
  }
ok:;
  for (long long i = 1; i <= n; ++i) {
    if (visited[i] != required[i]) {
      cout << 0 << endl;
      return 0;
    }
  }
  cout << ans << endl;
  return 0;
}
