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 Inf = 1e9 + 7;
const int N = 1e6 + 7;
int n, m;
int vis[N];
vector<int> gr[N];
long long calc(long long x) { return x * (x - 1) / 2; }
void dfs(int a, int par) {
  vis[a] = 1;
  for (int b : gr[a])
    if (b != par && vis[b] == 0) dfs(b, a);
}
void solve() {
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int a, b;
    cin >> a >> b;
    gr[a].push_back(b);
    if (a != b) gr[b].push_back(a);
  }
  dfs(1, 0);
  for (int a = 1; a <= n; a++)
    if (vis[a] == 0) {
      cout << "0" << '\n';
      return;
    }
  long long res = 0;
  long long loop = 0;
  for (int a = 1; a <= n; a++) {
    long long reg = 0;
    for (int b : gr[a]) {
      if (b != a)
        reg++;
      else
        loop++;
    }
    res += calc(reg);
  }
  res += loop * (m - 1);
  res -= loop * (loop - 1) / 2;
  cout << res << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout.precision(9);
  cout << fixed;
  solve();
  return 0;
}
