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;
vector<pair<int, int> > adj[1000006];
bool visited[1000006];
long long int n, m;
int edge[1000006] = {0};
long long int ans = 0;
void dfs(int u, int v) {
  visited[u] = true;
  long long int b = adj[u].size();
  ans += (b) * (b - 1) / 2;
  for (auto it = adj[u].begin(); it != adj[u].end(); it++) {
    if (it->first != v) {
      edge[it->second] = -1;
      if (!visited[it->first]) dfs(it->first, u);
    }
  }
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n >> m;
  long long int x, y;
  memset(visited, false, max(n + 1, m + 1));
  int c = 0;
  for (int i = 1; i <= m; i++) {
    cin >> x >> y;
    if (x == y) {
      edge[x] = x;
      c++;
    } else {
      adj[x].push_back(make_pair(y, i));
      adj[y].push_back(make_pair(x, i));
    }
  }
  ans += c * (m - c);
  ans += c * (c - 1) / 2;
  dfs(x, 0);
  for (int i = 1; i <= m; i++) {
    if (edge[i] != -1) {
      if (edge[i] == 0 || visited[edge[i]] == 0) ans = 0;
    }
  }
  cout << ans;
  return 0;
}
