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;
int64_t ans;
int n, m, ve, ts[1000001], nn[1000001], t, cut[1000001], p[1000001],
    vis[1000001], low[1000001];
vector<int> e[1000001];
void dfs(int i) {
  low[i] = ts[i] = ++t;
  vis[i] = 1;
  for (auto&& x : e[i])
    if (!vis[x]) {
      p[x] = i;
      dfs(x);
      low[i] = min(low[i], low[x]);
      if (low[x] > ts[i]) cut[x] = 1;
    } else if (x != p[i])
      low[i] = min(low[i], low[x]);
}
int main() {
  scanf("%d%d", &n, &m);
  if (m < 2) return puts("0"), 0;
  for (int _ = 0; _ < m; ++_) {
    int s, t;
    scanf("%d%d", &s, &t);
    if (s == t)
      ++nn[s];
    else
      e[s].push_back(t), e[t].push_back(s);
  }
  for (int i = 1; i <= n; ++i)
    if (e[i].size()) {
      dfs(i);
      break;
    }
  for (int i = 1; i <= n; ++i)
    if ((nn[i] || e[i].size()) && !vis[i]) return puts("0"), 0;
  int64_t slc = accumulate(nn, nn + n + 1, 0);
  ans = slc * (slc - 1);
  for (int i = 1; i <= n; ++i) {
    int no = nn[i];
    nn[i] = 0;
    for (auto&& x : e[i])
      if (!cut[x] || e[x].size() == 1) ++nn[i];
    ans += nn[i] * (nn[i] - 1);
    ans += slc * nn[i];
  }
  cout << ans / 2;
}
