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;
vector<long long> adjList[1000001];
vector<long long> visited(1000001);
long long vis;
long long ans;
void dfs(long long s) {
  deque<long long> q;
  q.push_back(s);
  visited[s] = 1;
  vis++;
  while (!q.empty()) {
    int v = q.front();
    q.pop_front();
    long long deg = adjList[v].size();
    ans += (deg * (deg - 1)) / 2;
    for (long long i = 0; i < adjList[v].size(); i++) {
      long long child = adjList[v][i];
      if (!visited[child]) {
        visited[child] = 1;
        vis++;
        q.push_back(child);
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n, m;
  cin >> n >> m;
  long long loop = 0;
  for (long long i = 0; i < m; i++) {
    long long u, v;
    cin >> u >> v;
    if (u == v)
      loop++;
    else {
      adjList[u].push_back(v);
      adjList[v].push_back(u);
    }
  }
  ans = 0;
  vis = 0;
  dfs(1);
  ans = ans + loop * (m - 1) - (loop * (loop - 1)) / 2;
  if (vis == n)
    cout << ans;
  else
    cout << 0;
}
