#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 xx[MAXN];
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++;
      xx[u] = 1;
      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 (xx[i] != 0 || 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);
}
