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 maxn = 1000005;
vector<long long> G[maxn];
bool vis[maxn];
bool is_loop[maxn];
long long n, m;
void dfs(long long u) {
  vis[u] = 1;
  for (long long i = 0; i < G[u].size(); ++i) {
    long long v = G[u][i];
    if (vis[v] == 0) {
      dfs(v);
    }
  }
}
int main() {
  scanf("%I64d%I64d", &n, &m);
  for (long long i = 1; i <= n; ++i) {
    G[i].clear();
  }
  memset(is_loop, 0, sizeof(is_loop));
  long long st, ed;
  long long loop = 0;
  for (long long i = 0; i < m; ++i) {
    scanf("%d%d", &st, &ed);
    if (st != ed) {
      G[st].push_back(ed);
      G[ed].push_back(st);
    } else {
      is_loop[st] = 1;
      ++loop;
      G[st].push_back(ed);
    }
  }
  memset(vis, 0, sizeof(vis));
  for (long long i = 1; i <= n; ++i) {
    if (G[i].size()) {
      dfs(i);
      break;
    }
  }
  for (long long i = 1; i <= n; ++i) {
    if (G[i].size() && vis[i] == 0) {
      printf("0\n");
      return 0;
    }
  }
  long long ans = 0;
  for (long long i = 1; i <= n; ++i) {
    long long cnt = G[i].size();
    if (cnt) {
      if (is_loop[i] == 1) {
        --cnt;
      }
      ans += cnt * (cnt - 1) / 2;
    }
  }
  ans += loop * (m - loop);
  ans += loop * (loop - 1) / 2;
  printf("%I64d\n", ans);
  return 0;
}
