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;
namespace flyinthesky {
const int MAXN = 1000000 + 5;
int n, m, lp, f[MAXN], deg[MAXN];
int find(int x) { return x == f[x] ? x : f[x] = find(f[x]); }
void clean() { lp = 0, memset(deg, 0, sizeof deg); }
int solve() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; ++i) f[i] = i;
  for (int u, v, i = 1; i <= m; ++i) {
    scanf("%d%d", &u, &v);
    if (u == v)
      ++lp;
    else {
      ++deg[u], ++deg[v];
      int x = find(u), y = find(v);
      if (x != y) f[x] = y;
    }
  }
  for (int i = 1; i <= n; ++i) find(i);
  int cnt = 0;
  for (int i = 1; i <= n; ++i)
    if (f[i] == i) ++cnt;
  if (cnt > 1) return printf("0\n"), 0;
  long long ans = lp * (lp - 1ll) / 2ll;
  ans += lp * (m - lp);
  for (int i = 1; i <= n; ++i)
    if ((long long)deg[i] >= 2)
      ans += ((long long)deg[i] - 1ll) * (long long)deg[i] / 2ll;
  cout << ans;
  return 0;
}
}  // namespace flyinthesky
int main() {
  flyinthesky::solve();
  return 0;
}
