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 n, m, i;
long long res, k;
int x[1000100], y[1000100], a[1000100];
bool c[1000100];
vector<int> b[1000100];
void dfs(int x) {
  c[x] = false;
  for (int i = 0; i < b[x].size(); i++)
    if (c[b[x][i]]) dfs(b[x][i]);
}
int main() {
  scanf("%d %d", &n, &m);
  k = 0;
  for (i = 1; i <= m; i++) {
    scanf("%d %d", &x[i], &y[i]);
    if (x[i] == y[i])
      k++;
    else {
      a[x[i]]++;
      a[y[i]]++;
      b[x[i]].push_back(y[i]);
      b[y[i]].push_back(x[i]);
    }
  }
  memset(c, true, sizeof(c));
  dfs(1);
  for (i = 1; i <= m; i++)
    if (c[x[i]] == false) {
      printf("0");
      return 0;
    }
  for (i = 1; i <= m; i++)
    if (x[i] != y[i]) res += (a[x[i]] - 1) + (a[y[i]] - 1);
  res = res / 2;
  res += k * (k - 1) / 2;
  res += (m - k) * k;
  printf("%lld", res);
}
