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 double pi = 3.141592653589793238462643383279502884L;
const int sz = 1e6 + 5;
vector<int> edge[sz];
int group[sz];
int Find(int n) {
  int g = group[n];
  if (g != n) {
    group[n] = Find(g);
  }
  return group[n];
}
void Union(int a, int b) {
  int ag = Find(a);
  int bg = Find(b);
  if (ag != bg) {
    group[ag] = bg;
  }
}
int main() {
  ios::sync_with_stdio(false);
  long long int n, m;
  cin >> n >> m;
  long long int loop = 0;
  for (int i = 0; i < n; ++i) {
    group[i] = i;
  }
  for (int i = 0; i < m; ++i) {
    int u, v;
    cin >> u >> v;
    --u, --v;
    if (u != v) {
      edge[u].push_back(v);
      edge[v].push_back(u);
      Union(u, v);
    } else {
      ++loop;
    }
  }
  for (int i = 0; i < n - 1; ++i) {
    if (Find(i) != Find(i + 1)) {
      cout << 0 << endl;
      return 0;
    }
  }
  long long int ans = 0;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < edge[i].size(); ++j) {
      int to = edge[i][j];
      ans += edge[to].size() - 1;
    }
  }
  assert(ans % 2 == 0);
  ans /= 2;
  cout << ans + (m - loop) * loop + loop * (loop - 1) / 2 << endl;
}
