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 GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
using namespace std;
long long MOD = 1000000007;
double eps = 1e-12;
const int N = 1e6 + 7;
int n, m, cnt;
vector<int> undirG[N];
bool vis[N];
vector<int> loops;
void dfs(int u) {
  vis[u] = true;
  cnt++;
  for (auto v : undirG[u]) {
    if (!vis[v]) dfs(v);
  }
  return;
}
void solve() {
  cin >> n >> m;
  for (long long i = 1; i <= m; i++) {
    int u, v;
    cin >> u >> v;
    if (u == v)
      loops.push_back(u);
    else {
      undirG[u].push_back(v);
      undirG[v].push_back(u);
    }
  }
  cnt = 0;
  dfs(1);
  if (cnt < n) {
    cout << "0\n";
    return;
  }
  long long ans = 0;
  for (long long i = 1; i <= n; i++) {
    long long len = ((long long)(undirG[i]).size());
    if (len >= 2) {
      long long var = len * (len - 1);
      var /= 2;
      ans += var;
    }
  }
  long long loopcnt = ((long long)(loops).size());
  ans += (loopcnt * (m - 1));
  if (loopcnt >= 2) {
    long long var1 = loopcnt * (loopcnt - 1);
    var1 /= 2;
    ans -= var1;
  }
  cout << ans << "\n";
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t = 1;
  for (int it = 1; it <= t; it++) {
    solve();
  }
  return 0;
}
