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;
int fid[1000000];
void init(int n) {
  for (int i = 0; i < n; i++) fid[i] = i;
}
int find(int i) {
  if (fid[i] == i) return i;
  return fid[i] = find(fid[i]);
}
void join(int i, int j) {
  i = find(i), j = find(j);
  fid[i] = j;
}
int deg[1000000];
int l[1000000];
int main() {
  int N, M, a, b;
  cin >> N >> M;
  init(N);
  int loops = 0;
  for (int i = 0; i < M; i++) {
    cin >> a >> b;
    a--, b--;
    if (a == b)
      loops++, l[a]++;
    else
      deg[a]++, deg[b]++;
    join(a, b);
  }
  int comp = 0;
  for (int i = 0; i < N; i++)
    if (find(i) == i && deg[i] + l[i] > 0) comp++;
  if (comp > 1) {
    cout << 0 << '\n';
    return 0;
  }
  long long ans = 0;
  for (int i = 0; i < N; i++) ans += (deg[i] * ((long long)(deg[i] - 1))) / 2;
  ans += (loops * ((long long)(loops - 1))) / 2;
  for (int i = 0; i < N; i++) ans += l[i] * ((long long)deg[i]);
  cout << ans << '\n';
}
