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;
vector<long long> g[(long long)(2e6 + 3)];
long long cnt, cntEdge, selfCnt, n, m;
bool seen[(long long)(2e6 + 3)], self[(long long)(2e6 + 3)];
void dfs(long long u) {
  seen[u] = true;
  for (long long i = 0; i < g[u].size(); i++) {
    long long ch = g[u][i];
    long long dch = g[ch].size();
    cntEdge++;
    cnt += dch - 1;
    if (u == ch) {
      cnt -= (dch - 1) * 2;
      cnt += (m - 1) * 2;
      cnt -= (selfCnt - 1);
    }
    if (seen[ch]) continue;
    dfs(ch);
  }
}
void solve() {
  cin >> n >> m;
  long long sumEdge = 0;
  for (long long i = 0; i < m; i++) {
    long long a, b;
    cin >> a >> b;
    a--, b--;
    if (a == b) {
      g[a].push_back(b);
      sumEdge++;
      selfCnt++;
      self[a] = true;
    } else {
      g[a].push_back(b);
      g[b].push_back(a);
      sumEdge += 2;
    }
  }
  dfs(0);
  if (cntEdge < sumEdge) {
    cout << 0 << endl;
    return;
  }
  cout << cnt / 2 << endl;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  solve();
}
