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 = 1000010;
long long INF = 0x7fffffffffffffff;
int n, m;
struct edge {
  int v, next;
} e[MAXN << 1];
int head[MAXN];
int tot = 0;
void add(int u, int v) {
  e[tot].v = v;
  e[tot].next = head[u];
  head[u] = tot++;
}
long long d[MAXN];
int vis[MAXN];
void dfs(int u) {
  vis[u] = 1;
  for (int k = head[u]; k != -1; k = e[k].next) {
    int v = e[k].v;
    if (!vis[v]) dfs(v);
  }
}
int main() {
  memset(head, -1, sizeof(head));
  memset(d, 0, sizeof(d));
  memset(vis, 0, sizeof(vis));
  scanf("%d%d", &n, &m);
  long long t = 0;
  for (int i = 0; i < m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    add(u, v);
    add(v, u);
    if (u == v) {
      t++;
      continue;
    }
    d[u]++;
    d[v]++;
  }
  for (int i = 1; i <= n; i++) {
    if (d[i]) {
      dfs(i);
      break;
    }
  }
  for (int i = 1; i <= n; i++) {
    if (!vis[i]) {
      if (d[i] != 0) {
        puts("0");
        return 0;
      }
    }
  }
  long long s = 0;
  s += t * (t - 1) / 2;
  s += t * (m - t);
  for (int i = 1; i <= n; i++) {
    if (d[i] >= 2) {
      s += d[i] * (d[i] - 1) / 2;
    }
  }
  printf("%I64d\n", s);
}
