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>
int* array;
int Root(int index) {
  if (array[index] == -1) return array[index] = index;
  if (array[index] == index) return index;
  return array[index] = Root(array[index]);
}
int main() {
  int n, m;
  scanf("%d %d", &n, &m);
  int coils = 0;
  int connect[n];
  array = connect + 0;
  int notcoils[n];
  for (int i = 0; i < n; i++) {
    connect[i] = -1;
    notcoils[i] = 0;
  }
  for (int i = 0; i < m; i++) {
    int b, e;
    scanf("%d %d", &b, &e);
    if (b == e) {
      if (connect[i] == -1) connect[i] = b;
      ++coils;
    } else {
    }
  }
  int notcoilsTotal = m - coils;
  int r = -1;
  for (int i = 0; i < n; i++) {
    if (connect[i] != -1 && connect[i] != r) {
      if (r == -1)
        r = connect[i];
      else {
        printf("%d", 0);
        return 0;
      }
    }
  }
  int ans = coils * (coils - 1) / 2 + notcoilsTotal * coils;
  for (int i = 0; i < n; i++) {
    int nc = notcoils[i];
    ans += nc * (nc - 1) / 2;
  }
  printf("%d", ans);
  return 0;
}
