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;
long long n, m;
vector<long long> maps[1000005];
long long vis[1000005];
long long zihuanege[1000005];
struct node {
  long long from, to;
};
node ege[1000005];
vector<long long> gudian;
void dfs(long long pos) {
  if (vis[pos] == 1) {
    return;
  }
  vis[pos] = 1;
  for (long long i = 0; i < maps[pos].size(); i++) {
    long long id = maps[pos][i];
    dfs(id);
  }
}
int main() {
  std::ios::sync_with_stdio(false);
  while (cin >> n >> m) {
    long long zihuan = 0;
    for (long long i = 1; i <= m; i++) {
      long long a, b;
      cin >> a >> b;
      ege[i].from = a;
      ege[i].to = b;
      if (a == b) {
        zihuan++;
        zihuanege[a] = 1;
      }
      maps[a].push_back(b);
      if (a != b) maps[b].push_back(a);
    }
    dfs(1);
    for (long long i = 1; i <= n; i++) {
      if (!vis[i]) gudian.push_back(i);
    }
    long long flag = 0;
    for (long long i = 0; i < gudian.size(); i++) {
      long long id = gudian[i];
      if (maps[id].size() != 0) {
        cout << "0" << endl;
        flag = 1;
        break;
      }
    }
    if (flag == 1) continue;
    long long ans = 0;
    for (long long i = 1; i <= n; i++) {
      for (long long j = 0; j < maps[i].size(); j++) {
        long long id = maps[i][j];
        if (id == i) {
          ans += (m - 1) << 1;
        } else {
          ans += (zihuan + maps[i].size() + maps[id].size() - 2);
          if (zihuanege[i]) ans -= 1;
          if (zihuanege[id]) ans -= 1;
        }
      }
    }
    cout << ans / 4 << endl;
  }
  return 0;
}
