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 maxx = 1000010;
const double pi = acos(-1.0);
const double eps = 1e-15;
vector<int> g[maxx];
int t, n, m, u, v;
int fa[maxx], siz[maxx], vis[maxx];
long long ans = 0, total = 0, sum = 0, cnt = 0;
int find(int x) {
  if (fa[x] == x) return x;
  return fa[x] = find(fa[x]);
}
void bfs(int s) {
  queue<int> q;
  q.push(s), q.push(1);
  while (!q.empty()) {
    int x = q.front();
    q.pop();
    int val = q.front();
    q.pop();
    if (val == 1) {
      for (int i = 0; i < g[x].size(); i++) {
        int to = g[x][i];
        if (to == s) continue;
        q.push(to), q.push(val + 1);
      }
    } else
      ans += g[x].size() - 1;
  }
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) fa[i] = i, siz[i] = 1;
  for (int i = 1; i <= m; i++) {
    scanf("%d%d", &u, &v), g[u].push_back(v), g[v].push_back(u);
    u = find(u), v = find(v);
    if (u != v) fa[u] = v, siz[v] += siz[u], siz[u] = 0;
  }
  for (int i = 1; i <= n; i++) {
    int X = find(i);
    if (!vis[X]) {
      vis[X] = 1;
      if (siz[X] >= 2) total++;
      if (total >= 2) {
        printf("0");
        return 0;
      }
    }
  }
  for (int i = 1; i <= n; i++) bfs(i);
  ans /= 2ll;
  printf("%lld", ans);
  return 0;
}
