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 MAX = 1e6 + 7;
long long n, m;
long long deg[MAX], self_loop;
bool loop[MAX], visited[MAX];
vector<int> adj[MAX];
long long nc2(long long x) {
  long long ans = x * (x - 1) / 2;
  return ans;
}
void dfs(int i) {
  visited[i] = true;
  for (auto j : adj[i])
    if (!visited[j]) dfs(j);
}
long long func() {
  dfs(1);
  long long ans = self_loop * (m - self_loop);
  ans += nc2(self_loop);
  for (int i = 1; i <= n; i++) {
    if (!visited[i] && (loop[i] || deg[i] != 0)) return 0;
    ans += nc2(deg[i]);
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n >> m;
  for (int i = 1; i <= m; i++) {
    int u, v;
    cin >> u >> v;
    if (u == v)
      loop[v] = true, self_loop++;
    else {
      deg[u]++, deg[v]++;
      adj[u].push_back(v);
      adj[v].push_back(u);
    }
  }
  cout << func() << endl;
  return 0;
}
