#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
istream& operator>>(istream& in, pair<T1, T2>& a) {
  in >> a.first >> a.second;
  return in;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& out, pair<T1, T2> a) {
  out << a.first << " " << a.second;
  return out;
}
template <typename T, typename T1>
T amax(T& a, T1 b) {
  if (b > a) a = b;
  return a;
}
template <typename T, typename T1>
T amin(T& a, T1 b) {
  if (b < a) a = b;
  return a;
}
const long long INF = 1e18;
const int32_t M = 1e9 + 7;
const int32_t MM = 998244353;
const long long N = 1e6 + 5;
vector<long long> v[N];
long long vis[N];
long long self[N];
void dfs(long long z, long long p) {
  vis[z] = 1;
  for (long long x : v[z]) {
    if (vis[x]) continue;
    dfs(x, z);
  }
}
void solve() {
  long long n, m, k = 0;
  cin >> n >> m;
  vector<pair<long long, long long> > e;
  for (long long i = 0; i < m; i++) {
    long long x, y;
    cin >> x >> y;
    if (x == y) {
      k++;
      self[x] = 1;
    } else {
      v[x].push_back(y);
      v[y].push_back(x);
      e.push_back({x, y});
    }
  }
  long long ans = 0;
  for (pair<long long, long long> a : e) {
    ans += (long long)((v[a.first]).size()) +
           (long long)((v[a.second]).size()) - 2;
  }
  ans /= 2;
  ans += k * (k - 1) / 2 + k * (m - k);
  bool f = 0;
  for (long long i = 1; i < n + 1; i++) {
    if (vis[i]) continue;
    if ((long long)((v[i]).size()) || self[i]) {
      if (f) {
        ans = 0;
        break;
      }
      f = 1;
      dfs(i, 0);
    }
  }
  cout << ans;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) solve();
  return 0;
}
