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 int maxN = 1e6 + 190;
vector<int> vt[maxN];
int n, m, d[maxN], loop[maxN];
void io() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
}
void dfs(int u) {
  d[u] = 1;
  for (__typeof((vt[u]).begin()) it = (vt[u]).begin(); it != (vt[u]).end();
       ++it) {
    int v = *it;
    if (d[v] == 0) dfs(v);
  }
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i < m; ++i) {
    int a, b;
    scanf("%d%d", &a, &b);
    vt[a].push_back(b);
    vt[b].push_back(a);
  }
  dfs(1);
  for (int i = 1; i <= n; ++i)
    if (d[i] == 0) {
      cout << 0;
      exit(0);
    }
  long long ans = 0;
  for (int i = 1; i <= n; ++i)
    for (__typeof((vt[i]).begin()) it = (vt[i]).begin(); it != (vt[i]).end();
         ++it)
      if (i == *it) loop[i]++;
  for (int i = 1; i <= n; ++i) {
    int regular = vt[i].size();
    regular -= loop[i];
    ans += regular * (regular - 1) / 2;
  }
  int sum_loop = 0;
  for (int i = 1; i <= n; ++i) sum_loop += loop[i];
  ans += sum_loop * (m - 1);
  ans -= sum_loop * (sum_loop - 1) / 2;
  cout << ans;
  return 0;
}
