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 answer = 0;
struct node {
  bool dfsd = false;
  vector<int> connected;
};
int gl_count = 0;
void dfs(node* nodes, int index) {
  nodes[index].dfsd = true;
  gl_count++;
  for (auto i : nodes[index].connected) {
    if (!nodes[i].dfsd) dfs(nodes, i);
  }
  return;
}
int main() {
  int n, m;
  scanf("%i%i", &n, &m);
  int to_go = m;
  node* nodes = new node[n];
  for (int i = 0; i < m; i++) {
    int a, b;
    scanf("%i%i", &a, &b);
    a--;
    b--;
    if (a == b) {
      answer += to_go - 1;
      to_go--;
    } else {
      nodes[a].connected.push_back(b);
      nodes[b].connected.push_back(a);
    }
  }
  dfs(nodes, 0);
  if (gl_count != n) {
    cout << 0;
    return 0;
  }
  long long buff = 0;
  for (int i = 0; i < n; i++) {
    buff += nodes[i].connected.size() * (nodes[i].connected.size() - 1) / 2;
  }
  cout << answer + buff;
  return 0;
}
