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 mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const double eps = 1e-10;
const double pi = acos(-1.0);
const int MAX_N = 1e6 + 7;
struct Edge {
  int u, v;
} a[MAX_N];
long long n, m;
vector<int> G[MAX_N];
int vis[MAX_N];
int deg[MAX_N];
void dfs(int v) {
  vis[v] = 1;
  for (int i = 0; i < G[v].size(); i++)
    if (!vis[G[v][i]]) dfs(G[v][i]);
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> m;
  int loop = 0;
  for (int i = 0; i < m; i++) {
    int u, v;
    cin >> u >> v;
    a[i].u = u, a[i].v = v;
    if (u != v)
      G[u].push_back(v), G[v].push_back(u);
    else
      loop++;
    deg[u]++, deg[v]++;
  }
  for (int i = 1; i < n + 1; i++)
    if (deg[i]) dfs(i);
  for (int i = 1; i < n + 1; i++)
    if (!vis[i] && deg[i]) return puts("0"), 0;
  long long ans = 0;
  for (int i = 1; i < m + 1; i++) {
    int x = a[i].u, y = a[i].v;
    if (x != y)
      ans += G[x].size() - 1 + G[y].size() - 1 + loop;
    else
      ans += m - 1;
  }
  cout << ans / 2 << endl;
  return 0;
}
