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 int> ke[1000002];
long long int soCanh[1000002];
long long int loooop[1000003];
long long int dau[1000003];
stack<long long int> s;
int main() {
  int n, m, u, v;
  long long int loop = 0;
  cin >> n >> m;
  for (long long int i = 1; i <= m; i++) {
    scanf("%d%d", &u, &v);
    if (u == v) {
      loooop[i]++;
      loop++;
    } else {
      ke[u].push_back(v);
      ke[v].push_back(u);
      soCanh[u]++;
      soCanh[v]++;
    }
  }
  for (long long int i = 1; i <= n; i++) {
    ke[i].push_back(0);
  }
  s.push(u);
  dau[u] = 1;
  while (!s.empty()) {
    u = s.top();
    s.pop();
    for (long long int i = 0; v = ke[u][i]; i++) {
      if (dau[v] == 0) {
        dau[v] = 1;
        s.push(v);
      }
    }
  }
  long long int connected = 1;
  for (long long int i = 1; i <= n; i++) {
    if (dau[i] == 0 && (loooop[i] + soCanh[i] > 0)) {
      connected = 0;
      cout << "dinh " << i << "ko duoc di den";
      break;
    }
  }
  if (connected == 0) {
    cout << "0";
  } else {
    long long int result = 0;
    for (long long int i = 1; i <= n; i++) {
      result += soCanh[i] * (soCanh[i] - 1) / 2;
    }
    result += loop * (m - loop) + loop * (loop - 1) / 2;
    cout << result;
  }
}
