#include <bits/stdc++.h>
using namespace std;
int par[1100000];
int rank1[1100000];
void init(long long n) {
  for (int i = 0; i <= n; ++i) {
    par[i] = i;
    rank1[i] = 0;
  }
}
int find(int x) {
  if (par[x] == x) return x;
  return par[x] = find(par[x]);
}
void unite(int x, int y) {
  x = find(x);
  y = find(y);
  if (x == y) return;
  if (rank1[x] < rank1[y])
    par[x] = y;
  else {
    par[y] = x;
    if (rank1[x] == rank1[y]) rank1[x]++;
  }
}
long long vis[1100000];
bool flag[1100000];
int main() {
  long long n, m;
  while (~scanf("%lld%lld", &n, &m)) {
    memset(vis, 0, sizeof(vis));
    memset(flag, false, sizeof(flag));
    int a, b;
    init(n);
    long long num = 0;
    for (int i = 0; i < m; ++i) {
      scanf("%d%d", &a, &b);
      unite(a, b);
      if (a == b) {
        num++;
      } else {
        vis[a]++;
        vis[b]++;
      }
      flag[a] = flag[b] = true;
    }
    long long cnt = 0;
    long long ans = num * (m - num) + num * (num - 1) / 2;
    for (int i = 1; i <= n; ++i) {
      if (flag[i] && par[i] == i) cnt++;
      ans += (vis[i] - 1) * vis[i] / 2;
    }
    if (cnt > 1)
      printf("0\n");
    else
      printf("%lld\n", ans);
  }
  return 0;
}
