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;
template <class S, class T>
ostream& operator<<(ostream& o, const pair<S, T>& p) {
  return o << "(" << p.first << "," << p.second << ")";
}
template <class T>
ostream& operator<<(ostream& o, const vector<T>& vc) {
  o << "{";
  for (const T& v : vc) o << v << ",";
  o << "}";
  return o;
}
struct timer {
  double t;
  timer() { t = clock(); }
  ~timer() { printf("\nruntime %.3f s\n", get_time()); }
  double get_time() { return (clock() - t) / CLOCKS_PER_SEC; }
};
long long n, loops, m, deg[1000005], vis[1000005], conc[1000005], ans;
vector<long long> adj[1000005];
void dfs(long long s) {
  if (vis[s]) return;
  vis[s] = 1;
  for (auto t : adj[s]) {
    dfs(t);
  }
}
signed main() {
  scanf("%d%d", &n, &m);
  for (long long i = 1; i <= m; i++) {
    long long x, y;
    scanf("%d%d", &x, &y);
    conc[x] = 1;
    conc[y] = 1;
    if (x == y) {
      loops++;
    } else {
      adj[x].push_back(y);
      adj[y].push_back(x);
      deg[x]++;
      deg[y]++;
    }
  }
  for (long long i = 1; i <= n; i++) {
    if (conc[i]) {
      dfs(i);
      break;
    }
  }
  for (long long i = 1; i <= n; i++) {
    if (!vis[i] && conc[i]) {
      cout << 0 << endl;
      return 0;
    }
  }
  ans = (loops) * (loops - 1) / 2;
  ans += (loops) * (m - loops);
  for (long long i = 1; i <= n; i++) {
    ans += deg[i] * (deg[i] - 1) / 2;
  }
  cout << ans << endl;
  return 0;
}
