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 A, class B>
ostream& operator<<(ostream& out, const pair<A, B>& a) {
  return out << "(" << a.first << ", " << a.second << ")";
}
template <class A>
ostream& operator<<(ostream& out, const vector<A>& v) {
  out << "[";
  for (int i = 0; i < int(int(v.size())); i++) {
    if (i) out << ", ";
    out << v[i];
  }
  return out << "]";
}
const int INF = int(1e9);
const long long INF64 = long long(1e18);
const int MOD = INF + 7;
const long double EPS = 1e-9;
const long double PI = acos(-1.0);
const int N = 100 * 1000 + 11;
int n, m;
int cntp;
bool wasp[N];
vector<int> g[N];
bool read() {
  if (scanf("%d %d", &n, &m) != 2) return false;
  for (int i = 0; i < int(m); i++) {
    int first, second;
    scanf("%d %d", &first, &second);
    --first, --second;
    g[first].push_back(second);
    if (first != second)
      g[second].push_back(first);
    else {
      wasp[i] = true;
      cntp++;
    }
  }
  return true;
}
int cnt;
bool used[N];
void dfs(int v) {
  used[v] = true;
  for (auto to : g[v])
    if (!used[to]) dfs(to);
}
void solve() {
  for (int i = 0; i < int(n); i++) {
    if (!used[i]) {
      cnt++;
      dfs(i);
    }
  }
  if (cnt != 1) {
    puts("0");
    return;
  }
  long long ans = 0;
  for (int i = 0; i < int(n); i++) {
    ans += (int(g[i].size()) * 1ll * (int(g[i].size()) - 1) / 2);
    ans += (wasp[i] * 1ll * (m - int(g[i].size()) - cntp + 1));
  }
  ans += (cntp * 1ll * (cntp - 1) / 2);
  printf("%lld\n", ans);
}
int main() {
  mt19937 rnd(time(NULL));
  cerr.precision(15);
  cout.precision(15);
  cerr << fixed;
  cout << fixed;
  while (read()) {
    solve();
  }
}
