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 MAXN = 1e5 + 5;
const long long mod = 998244353;
long long pw(long long b, long long r, long long md = mod) {
  b = b % md;
  long long ans = 1;
  while (r) {
    if (r & 1) ans = (ans * b) % md;
    b = (b * b) % md;
    r >>= 1;
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long T = 1;
  while (T--) {
    long long n, m;
    cin >> n >> m;
    bool vis[n + 1];
    memset(vis, 0, sizeof vis);
    ;
    long long counter = 0;
    vector<long long> adj[n + 1];
    long long reg[n + 1], loop = 0;
    memset(reg, 0, sizeof reg);
    ;
    for (long long i = 0; i <= m - 1; ++i) {
      long long a, b;
      cin >> a >> b;
      adj[a].push_back(b);
      if (b != a) {
        adj[b].push_back(a);
        reg[b]++;
        reg[a]++;
      } else
        loop++;
    }
    for (long long i = 1; i <= n; ++i) {
      if (!vis[i]) {
        counter++;
        queue<long long> q;
        q.push(i);
        vis[i] = true;
        while (!q.empty()) {
          long long u = q.front();
          q.pop();
          for (auto x : adj[u]) {
            if (!vis[x]) {
              vis[x] = true;
              q.push(x);
            }
          }
        }
      }
    }
    if (counter > 1) {
      cout << 0 << '\n';
      continue;
    }
    long long ans = 0;
    for (long long i = 1; i <= n; ++i) {
      ans += (reg[i] * (reg[i] - 1)) >> 1;
    }
    ans += loop * (m - 1);
    ans -= (loop * (loop - 1)) >> 1;
    cout << ans << '\n';
  }
  return 0;
}
