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 MAXN = 1e6 + 5;
long long N, M, f[MAXN], deg[MAXN], ans = 0, cnt = 0, bl, root;
bool vis[MAXN];
namespace solution {
long long getf(long long k) {
  if (f[k] == k) return k;
  f[k] = getf(f[k]);
  return f[k];
}
void Prepare() {
  scanf("%lld%lld", &N, &M);
  for (long long i = 1; i <= N; i++) f[i] = i;
  bl = N;
  for (long long i = 1; i <= M; i++) {
    long long x, y;
    scanf("%lld%lld", &x, &y);
    f[getf(x)] = getf(y);
    vis[x] = vis[y] = 1;
    if (x != y) {
      deg[x]++;
      deg[y]++;
    } else
      cnt++;
    root = x;
  }
}
void Solve() {
  for (long long i = 1; i <= N; i++)
    if (vis[i] && getf(i) != root) {
      puts("0");
      return;
    }
  for (long long i = 1; i <= N; i++) {
    if (deg[i] >= 2) ans += deg[i] * (deg[i] - 1) / 2;
  }
  if (cnt >= 2) ans += cnt * (cnt - 1) / 2;
  if (cnt >= 1 && M - cnt >= 1) ans += cnt * (M - cnt);
  cout << ans << endl;
}
}  // namespace solution
int main() {
  using namespace solution;
  Prepare();
  Solve();
  return 0;
}
