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>
const long long N = 2000100;
const long long MX = 300300;
const long long MAGIC = sqrt(N);
const long long mod = 1e9 + 7;
using namespace std;
int n;
int m;
bool us[N];
bool used[N];
vector<int> v[N];
void dfs(int x) {
  if (used[x]) {
    return;
  }
  used[x] = true;
  for (int y : v[x]) {
    dfs(y);
  }
}
void solve() {
  scanf("%d%d", &n, &m);
  int cnt = 0;
  for (int i = 1; i <= m; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    us[x] = us[y] = true;
    if (x == y) {
      cnt++;
      continue;
    }
    v[x].push_back(y);
    v[y].push_back(x);
  }
  dfs(1);
  for (int i = 1; i <= n; i++) {
    if (us[i] && used[i] == false) {
      cout << 0 << endl;
      return;
    }
  }
  long long ans1 = 1ll * cnt * (cnt - 1) / 2 + 1ll * (m - cnt) * cnt;
  long long ans2 = 0;
  for (int i = 1; i <= n; i++) {
    for (int x : v[i]) {
      ans2 += v[x].size() - 1;
    }
  }
  cout << ans2 / 2 + ans1 << endl;
}
bool mtest = false;
int main() {
  ios_base::sync_with_stdio(0);
  int TE = 1;
  if (mtest) cin >> TE;
  while (TE--) solve();
  return 0;
}
