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 long long inf = (long long)1e+9 + 7ll;
const long long linf = (long long)1e+18 + 7ll;
const long double eps = (long double)1e-10;
const long double pi = acosl((long double)-1.0);
const int alph = 26;
static char buff[(int)2e6 + 17];
const int maxn = (int)1e6 + 17;
int n, m, cnt;
vector<int> g[maxn];
bool used[maxn], loop[maxn];
bool read() {
  if (scanf("%d %d", &n, &m) != 2) return false;
  for (long long i = 0ll; i < (long long)m; ++i) {
    int u, v;
    scanf("%d %d", &u, &v);
    if (u != v) {
      g[u - 1].push_back(v - 1);
      g[v - 1].push_back(u - 1);
    } else {
      loop[v] = true;
      ++cnt;
    }
  }
  return true;
}
void dfs(int v) {
  used[v] = true;
  for (auto to : g[v])
    if (!used[to]) dfs(to);
}
void solve() {
  for (int i = 0; i < n; ++i)
    if (!g[i].empty() || loop[i]) {
      dfs(i);
      break;
    }
  for (int i = 0; i < n; ++i)
    if (!used[i] && (!g[i].empty() || loop[i])) return void(printf("0\n"));
  long long ans = 1ll * cnt * (m - cnt) + 1ll * cnt * (cnt - 1) / 2;
  for (int i = 0; i < n; ++i)
    ans += 1ll * ((int)(g[i].size())) * (((int)(g[i].size())) - 1) / 2;
  printf("%lld\n", ans);
}
void gen() {}
void naive() {}
int main() {
  if (1) {
    while (read()) solve();
  } else {
    for (;;) {
      gen();
      solve();
      naive();
    }
  }
  return 0;
}
