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 loopCount = 0;
long long edgeCount = 0;
long long V, E;
vector<long long> neighbors[1000001];
vector<long long> verticies;
bool connected(long long x) {
  bool visited[1000001];
  for (long long i = 1; i <= V; i++) {
    visited[i] = false;
  }
  queue<long long> q;
  q.push(x);
  while (!q.empty()) {
    long long vertex = q.front();
    q.pop();
    if (visited[vertex]) continue;
    visited[vertex] = true;
    for (long long nei : neighbors[vertex]) {
      if (!visited[nei]) q.push(nei);
    }
  }
  for (long long vertex : verticies) {
    if (!visited[vertex]) {
      return false;
    }
  }
  return true;
}
long long choose2(long long n) {
  if (n <= 1) return 0;
  return (n * (n - 1)) / 2;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> V >> E;
  long long ans = 0;
  if (E == 1) {
    cout << 0 << '\n';
    return 0;
  }
  long long v, e;
  for (long long i = 0; i < E; i++) {
    cin >> v >> e;
    if (v == e) {
      loopCount++;
      continue;
    }
    edgeCount++;
    neighbors[v].push_back(e);
    neighbors[e].push_back(v);
    verticies.push_back(v);
    verticies.push_back(e);
  }
  if (!connected(v)) {
    cout << 0 << '\n';
    return 0;
  }
  for (long long i = 1; i <= V; i++) {
    ans += choose2(neighbors[i].size());
  }
  ans += choose2(loopCount);
  ans += loopCount * edgeCount;
  cout << ans << '\n';
  return 0;
}
