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;
long long n, m;
const int N = 1e6 + 5;
int x[N], y[N];
long long deg[N];
vector<vector<int> > v(N);
long long ans;
long long sz;
bool vis[N];
long long self;
void dfs(int node) {
  ++sz;
  vis[node] = true;
  for (int to : v[node]) {
    if (!vis[to]) dfs(to);
  }
}
int main() {
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= m; i++) {
    scanf("%d %d", &x[i], &y[i]);
    if (y[i] != x[i]) {
      v[x[i]].emplace_back(y[i]);
      v[y[i]].emplace_back(x[i]);
      deg[x[i]]++;
      deg[y[i]]++;
    }
    if (x[i] == y[i]) ++self;
  }
  ans = (self * (self - 1)) / 2 + (self * (m - self));
  for (int i = 1; i <= n; i++) {
    ans += (deg[i] * (deg[i] - 1)) / 2;
  }
  for (int i = 1; i <= n; i++) {
    if (deg[i]) {
      dfs(i);
      break;
    }
  }
  if (sz != n) ans = 0;
  cout << ans << endl;
}
