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;
void scanint(int &x) {
  register int c = getchar();
  x = 0;
  for (; (c < 48 || c > 57); c = getchar())
    ;
  for (; c > 47 && c < 58; c = getchar()) {
    x = (x << 1) + (x << 3) + c - 48;
  }
}
const int N = 1000006;
vector<int> v[N];
bool visited[N];
int parent[N], edges;
map<pair<int, int>, int> M;
void dfs(int u) {
  int pt;
  for (int i = 0; i < v[u].size(); i++) {
    pt = v[u][i];
    if (M[make_pair(u, pt)] || M[make_pair(pt, u)]) {
      edges++;
      M[make_pair(u, pt)] = 0;
      M[make_pair(pt, u)] = 0;
    }
    if (!visited[pt]) {
      visited[pt] = true;
      dfs(pt);
    }
  }
  return;
}
int main() {
  int n, m, a, b, cnt = 0;
  long long self = 0LL;
  scanint(n);
  scanint(m);
  for (int i = 1; i <= m; i++) {
    scanint(a);
    scanint(b);
    M[make_pair(a, b)] = 1;
    if (a == b) {
      v[a].push_back(a);
      self++;
    } else {
      v[a].push_back(b);
      v[b].push_back(a);
    }
  }
  long long answer = 0LL, sz;
  for (int i = 1; i <= n; i++) {
    sz = v[i].size();
    answer = answer + ((sz * (sz - 1LL)) / 2LL);
  }
  for (int i = 1; i <= n; i++) {
    if (!visited[i]) {
      visited[i] = true;
      parent[i] = i;
      edges = 0;
      dfs(i);
      if (edges) {
        cnt++;
        if (cnt > 1) break;
      }
    }
  }
  if (cnt > 1) {
    printf("0\n");
    return 0;
  }
  answer = answer + ((self * (self - 1LL)) / 2LL);
  printf("%lld\n", answer);
  return 0;
}
