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 MaxN = 1e6 + 16;
const int INF = 1e9;
const int MOD = 1e9 + 7;
long long ans = 0;
vector<int> v[MaxN];
int cnt2;
bool used[MaxN];
int n, m;
bool used2[MaxN][3];
void dfs(int x) {
  used[x] = true;
  for (int i = 0; i < v[x].size(); ++i) {
    int to = v[x][i];
    if (!used[to]) dfs(to);
  }
}
void solve1() {
  long long ans = 0;
  for (int i = 1; i <= n; ++i) {
    ans = ans + v[i].size() * 1ll * (v[i].size() - 1);
  }
  cout << ans / 2 << '\n';
  return;
}
int main() {
  ios_base ::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> m;
  if (m == 1) {
    cout << "0\n";
    return 0;
  }
  int start = 0;
  for (int i = 1; i <= m; ++i) {
    int x, y;
    cin >> x >> y;
    v[x].push_back(y);
    if (x != y) v[y].push_back(x);
    start = x;
  }
  dfs(start);
  for (int i = 1; i <= n; ++i)
    if (!used[i] && v[i].size()) {
      cout << "0\n";
      return 0;
    }
  cout << (m * 1ll * (m - 1)) / 2 << '\n';
  return 0;
  solve1();
}
