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, a, b;
long long oszukane, suma;
struct miasta {
  long long ile;
  bool byl;
  bool oszukany;
  list<int> l;
};
miasta tab[1000007];
int dzialaj(int nr) {
  if (tab[nr].byl) return 0;
  tab[nr].byl = 1;
  int res = 1;
  for (typeof(tab[nr].l.begin()) it = tab[nr].l.begin(); it != tab[nr].l.end();
       ++it) {
    res += dzialaj(*it);
  }
  return res;
}
int main() {
  scanf("%d %d", &n, &m);
  for (int i = 0; i < m; i++) {
    scanf("%d %d", &a, &b);
    if (a != b) {
      tab[a].l.push_back(b);
      tab[b].l.push_back(a);
      tab[a].ile++;
      tab[b].ile++;
      suma++;
    } else {
      tab[a].oszukany = 1;
      oszukane++;
    }
  }
  dzialaj(1);
  long long res = 0;
  for (int i = 1; i <= n; i++) {
    if (!tab[i].byl && (tab[i].ile > 0 || tab[i].oszukany)) {
      cout << 0 << endl;
      return 0;
    }
  }
  for (int i = 1; i <= n; i++) {
    res += tab[i].ile * (tab[i].ile - 1) / 2;
  }
  res += oszukane * suma;
  res += oszukane * (oszukane - 1) / 2;
  cout << res << endl;
  return 0;
}
