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>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int N = 1e6 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;
int n, m;
bool vis[N];
vector<int> G[N];
void dfs(int u) {
  vis[u] = true;
  for (int v : G[u])
    if (!vis[v]) dfs(v);
}
long long C2(long long x) { return x * (x - 1) / 2; }
int main() {
  ios_base::sync_with_stdio(0);
  while (cin >> n >> m) {
    int u, v;
    for (int i = 1; i <= n; ++i) G[i].clear();
    vector<int> is(n + 1, 0);
    long long cycle = 0;
    for (int i = 1; i <= m; ++i) {
      cin >> u >> v;
      if (u == v) {
        ++cycle;
        is[u] = true;
      }
      G[u].push_back(v);
      G[v].push_back(u);
    }
    memset(vis, 0, sizeof vis);
    dfs(u);
    bool ok = true;
    long long ans = 0;
    for (int i = 1; i <= n; ++i) {
      if (!vis[i] && G[i].size()) ok = false;
      ans += C2(G[i].size() - is[i]);
    }
    if (!ok) {
      cout << "0\n";
      continue;
    }
    ans += C2(cycle) + cycle * (m - cycle);
    cout << ans << endl;
  }
  return 0;
}
