#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 7;
int n, m, cnt = 0;
int degree[N], f[N], t[N];
bool vis[N], vist[N];
vector<int> edge[N];
void dfs(int u) {
  vis[u] = true;
  for (int i = 0; i < edge[u].size(); i++) {
    int v = edge[u][i];
    if (vis[v]) continue;
    dfs(v);
  }
}
inline int read() {
  int s = 0, w = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') w = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') s = s * 10 + ch - '0', ch = getchar();
  return s * w;
}
int main() {
  n = read(), m = read();
  for (int i = 1; i <= m; i++) {
    int x = read(), y = read();
    vist[x] = vist[y] = true;
    if (x != y) {
      edge[x].push_back(y);
      edge[y].push_back(x);
      degree[x]++, degree[y]++;
    } else
      cnt++;
    f[i] = x, t[i] = y;
  }
  for (int i = 1; i <= n; i++) {
    if (vist[i]) {
      dfs(i);
      break;
    }
  }
  for (int i = 1; i <= n; i++) {
    if (vist[i] == true && vis[i] == false) {
      printf("0\n");
      return 0;
    }
  }
  long long ans = 0;
  for (int i = 1; i <= m; i++) {
    if (f[i] == t[i]) {
      ans += m - 1;
    } else
      ans += degree[f[i]] + degree[t[i]] + cnt - 2;
  }
  printf("%lld\n", ans / 2);
  return 0;
}
