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;
const long long MAXN = 1e6;
bool used[MAXN];
vector<int> edges[MAXN];
void dfs(int n) {
  used[n] = true;
  for (int l(0); l < edges[n].size(); ++l) {
    int to = edges[n][l];
    if (!used[to]) {
      dfs(to);
    }
  }
}
int main() {
  long long n, m;
  cin >> n >> m;
  long long power[n];
  for (long long l(0); l < n; ++l) {
    power[l] = 0;
    used[l] = false;
  }
  for (long long l(0); l < m; ++l) {
    long long a, b;
    cin >> a >> b;
    --a;
    --b;
    edges[a].push_back(b);
    edges[b].push_back(a);
    ++power[a];
    if (a != b) {
      ++power[b];
    }
  }
  long long k(0);
  for (long long l(0); l < n; ++l) {
    if (!used[l]) {
      dfs(l);
      ++k;
    }
  }
  if (k > 1) {
    putchar('0');
    return 0;
  }
  long long ans(0);
  for (long long l(0); l < n; ++l) {
    ans += ((power[l] * power[l] - power[l]) >> 1);
  }
  cout << ans;
}
