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;
using ll = long long;
struct Dsu {
  int n;
  vector<int> p;
  vector<int> r;
  Dsu(int _n) {
    n = _n;
    p.resize(n);
    r.resize(n);
    init();
  }
  inline void init() {
    for (int i = 0; i < n; i++) {
      p[i] = i;
      r[i] = 1;
    }
  }
  inline int find(int x) { return p[x] == x ? x : p[x] = find(p[x]); }
  inline bool join(int x, int y) {
    x = find(x);
    y = find(y);
    if (x == y) return false;
    if (r[x] < r[y]) swap(x, y);
    p[y] = x;
    r[x] += r[y];
    return true;
  }
  inline bool check(int x, int y) { return find(x) == find(y); }
};
void solve() {
  int n, m;
  cin >> n >> m;
  Dsu d(n);
  vector<int> deg(n);
  int loop = 0;
  for (int _ = 0; _ < m; _++) {
    int x, y;
    cin >> x >> y;
    x--;
    y--;
    d.join(x, y);
    if (x == y) loop++;
    if (x != y) deg[x]++, deg[y]++;
  }
  ll res = 0;
  if (d.r[d.find(0)] == n) {
    for (ll x : deg) res += x * (x - 1) / 2;
    res += loop * (m - loop);
    res += loop * (loop - 1) / 2;
  }
  cout << res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
  return 0;
}
