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 long long int inf = (long long int)1e18 + 10;
const long long int MAX = 300;
long long int powmod(long long int x, long long int y) {
  long long int res = 1;
  while (y > 0) {
    if (y % 2) res = (res * x) % 1000000007;
    x = (x * x) % 1000000007;
    y /= 2;
  }
  return res;
}
long long int mul(long long int x, long long int y) {
  return (x * y) % 1000000007;
}
long long int gcd(long long int x, long long int y) {
  if (y == 0) return x;
  return gcd(y, x % y);
}
vector<long long int> v[1000006];
long long int vis[1000006] = {0}, tot = 0, mark[1000006] = {0};
vector<pair<long long int, long long int> > a;
bool check(long long int z) {
  long long int cnt = 0;
  for (long long int i = 0; i < a.size(); i++) cnt += mark[i];
  return (cnt == z);
}
void dfs(long long int x) {
  vis[x] = 1;
  long long int y;
  for (auto i : v[x]) {
    long long int p = a[i].first;
    long long int q = a[i].second;
    if (p == x)
      y = q;
    else
      y = p;
    mark[i] = 1;
    if (!vis[y]) dfs(y);
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int n, m, x, y, cnt = 0, z = 0;
  cin >> n >> m;
  for (long long int i = 1; i <= m; i++) {
    cin >> x >> y;
    if (x == y)
      cnt++;
    else
      v[x].push_back(z), v[y].push_back(z), z++, a.push_back({x, y});
  }
  long long int f = 0;
  for (long long int i = 1; i <= n; i++) {
    if (v[i].size() > 0) {
      dfs(i);
      f = 1;
      if (!check(z)) {
        cout << 0 << endl;
        return 0;
      }
      break;
    }
  }
  if (f == 0) {
    cout << 0 << endl;
    return 0;
  }
  long long int ans = cnt * (cnt - 1) / 2 + cnt * z;
  for (long long int i = 1; i <= n; i++) {
    x = v[i].size();
    ans += (x * (x - 1) / 2);
  }
  cout << ans << endl;
}
