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 double eps = 1e-6;
const int INF = 2e9;
const long long LNF = 9e18;
const int maxn = 1e6 + 7;
int n, m, vis[maxn], d[maxn], used[maxn], c[maxn];
vector<int> g[maxn];
void dfs(int u) {
  vis[u] = 1;
  for (int i = 0; i < g[u].size(); i++)
    if (!vis[g[u][i]]) dfs(g[u][i]);
}
int main() {
  int cnt = 0;
  scanf("%d%d", &n, &m);
  int x = 0;
  for (int i = 1; i <= m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    used[u] = used[v] = 1;
    if (u == v) {
      c[u] = 1;
      cnt++;
      continue;
    }
    g[u].push_back(v);
    g[v].push_back(u);
  }
  dfs(1);
  int B = 1;
  for (int i = 1; i <= n; i++)
    if (used[i] && !vis[i]) B = 0;
  long long ans = 0;
  for (int i = 1; i <= n; i++)
    if (vis[i]) ans += 1LL * g[i].size() * (g[i].size() - 1) / 2;
  ans += 1LL * cnt * (cnt - 1) / 2 + 1LL * cnt * (m - cnt);
  cout << 1LL * B * ans << endl;
}
