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 mod = (int)1e9 + 7;
const int inf = (int)1e9 + 123;
const long long infl = (long long)1e18 + 123;
const int MAX_N = (int)1e6 + 123;
int n, m;
vector<int> g[MAX_N];
bool have[MAX_N], good;
bool u[MAX_N];
void dfs(int v) {
  u[v] = 1;
  if (have[v]) good = 1;
  for (auto to : g[v]) {
    good = 1;
    if (!u[to]) dfs(to);
  }
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1, u, v; i <= m; i++) {
    scanf("%d%d", &u, &v);
    if (u == v)
      have[u] = 1;
    else
      g[u].push_back(v), g[v].push_back(u);
  }
  int cnt = 0;
  for (int i = 1; i <= n; i++)
    if (!u[i]) {
      good = 0;
      dfs(i);
      if (good) cnt++;
    }
  if (cnt > 1) {
    puts("0");
    return 0;
  }
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    if (have[i]) ans += (int)((g[i]).size());
    int first = 0, second = 0;
    for (int j = 0; j < (int)((g[i]).size()); j++) {
      bool tp = ((int)((g[g[i][j]]).size()) == 1);
      if (tp) ans += (int)((g[i]).size()) - j - 1 + second;
      if (tp)
        first++;
      else
        second++;
    }
  }
  printf("%lld\n", ans);
  return 0;
}
