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;
bitset<1000011> s;
long long ans, n, m, u, v, ns, res, d[1000011], p[1000011];
vector<int> g[1000011];
long long find(int v) { return p[v] ? p[v] = find(p[v]) : v; }
void unite(int v, int s) {
  v = find(v), s = find(s);
  if (v != s) {
    if (p[v] == p[s]) p[v]++;
    if (p[v] > p[s])
      p[v] = s;
    else
      p[s] = v;
    ans--;
  }
}
int main() {
  cin >> n >> m;
  ans = n;
  for (int(i) = int(0); (i) <= int(m - 1); (i)++) {
    scanf("%d", &u);
    scanf("%d", &v);
    if (u == v) {
      ns++;
      s[u] = 1;
      d[u] += 2;
      g[u].push_back(u);
    } else {
      g[u].push_back(v);
      g[v].push_back(u);
      d[u]++;
      d[v]++;
      unite(u, v);
    }
  }
  if (ans > 1) {
    cout << 0 << endl;
    return 0;
  }
  for (int(i) = int(1); (i) <= int(n); (i)++) {
    if (s[i]) {
      res += m - d[i] + 1;
      res += (d[i] - 2) * (d[i] - s[i] - 1);
    } else {
      res += d[i] * (d[i] - s[i] - 1);
    }
  }
  res += ns * (m - ns);
  cout << res / 2 << endl;
}
