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;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int n, m, degree[1000000] = {0}, to_self[1000000] = {0};
vector<int> adjlist[1000000];
bool vis[1000000] = {0};
queue<int> q;
int main() {
  scanf("%d %d", &n, &m);
  for (int(i) = 0; (i) < (m); (i)++) {
    int u, v;
    scanf("%d %d", &u, &v);
    u--;
    v--;
    if (u == v) {
      to_self[u]++;
      continue;
    }
    adjlist[u].push_back(v);
    adjlist[v].push_back(u);
    degree[u]++;
    degree[v]++;
  }
  q.push(0);
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    vis[u] = 1;
    for (int(i) = 0; (i) < (((int)(adjlist[u]).size())); (i)++) {
      int v = adjlist[u][i];
      if (!vis[v]) {
        q.push(v);
      }
    }
  }
  for (int(i) = 0; (i) < (n); (i)++) {
    if (!vis[i]) return 0 * puts("0");
  }
  long long an = 0, cnt = 0;
  for (int(i) = 0; (i) < (n); (i)++) {
    int u = i;
    long long one = 0;
    for (int(j) = 0; (j) < (((int)(adjlist[u]).size())); (j)++) {
      int v = adjlist[u][j];
      if (degree[v] == 1) one++;
    }
    if (one > 1) an = an + ((one * (one - 1ll)) / 2ll);
    if (to_self[u]) cnt++;
  }
  if (cnt > 0) an = an + (cnt * (cnt - 1)) / 2;
  for (int(i) = 0; (i) < (n); (i)++) {
    if (to_self[i]) an = an + degree[i];
  }
  printf("%lld\n", an);
  return 0;
}
