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 = 1e18;
const int mod = 1e9 + 7;
const int N = 1e6 + 10;
inline int add(int x, int y) {
  x += y;
  if (x >= mod) x -= mod;
  return x;
}
inline int mul(int x, int y) {
  x = (1LL * x * y) % mod;
  return x;
}
int deg[N];
vector<int> G[N];
int vis[N];
void dfs(int v) {
  vis[v] = 1;
  for (auto it : G[v]) {
    if (vis[it] == 0) dfs(it);
  }
}
int mark[N];
vector<pair<int, int> > E;
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  int n, m;
  memset(vis, 0, sizeof(vis));
  memset(deg, 0, sizeof(deg));
  cin >> n >> m;
  memset(mark, 0, sizeof(mark));
  int c = 0;
  for (int i = 0; i <= m - 1; ++i) {
    int u, v;
    cin >> u >> v;
    if (u == v) {
      mark[u] = 1;
      c++;
      continue;
    }
    deg[u]++;
    deg[v]++;
    G[u].push_back(v);
    if (u != v) G[v].push_back(u);
    E.push_back({u, v});
  }
  dfs(1);
  for (int i = 1; i <= n; ++i)
    if (vis[i] == 0) {
      cout << 0 << "\n";
      return 0;
    }
  long long ans = 1LL * c * (m - c);
  for (int i = 1; i <= n; ++i) {
    ans += 1LL * deg[i] * (deg[i] - 1) / 2;
  }
  cout << ans << "\n";
  return 0;
}
