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 maxn = 1e6 + 10;
int n, m;
std::vector<int> G[maxn];
long long loop = 0;
long long cnt[maxn];
int vis[maxn];
bool bfs() {
  memset(vis, 0, sizeof(vis));
  queue<int> Q;
  Q.push(1);
  while (!Q.empty()) {
    int u = Q.front();
    Q.pop();
    for (auto &v : G[u]) {
      if (!vis[v]) {
        Q.push(v);
        vis[v] = 1;
      }
    }
  }
  for (int i = 1; i <= n; ++i)
    if (!vis[i]) return false;
  return true;
}
int main(int argc, char const *argv[]) {
  memset(cnt, 0, sizeof(cnt));
  cin >> n >> m;
  for (int i = 0; i < m; ++i) {
    int u, v;
    scanf("%d%d", &u, &v);
    if (u == v) {
      loop++;
      continue;
    }
    cnt[u]++;
    cnt[v]++;
    G[u].push_back(v);
    G[v].push_back(u);
  }
  if (bfs()) {
    long long ans = loop * (m - 1);
    for (int i = 1; i <= n; ++i) {
      ans += (cnt[i] - 1) * cnt[i] / 2;
    }
    if (loop) ans -= loop * (loop - 1) / 2;
    std::cout << ans << '\n';
  } else
    std::cout << 0 << '\n';
  return 0;
}
