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;
void splitstr(const string &s, vector<string> &v) {
  istringstream in(s);
  copy(istream_iterator<string>(in), istream_iterator<string>(),
       back_inserter(v));
}
void err(vector<string>::iterator it) {}
template <typename T, typename... Args>
void err(vector<string>::iterator it, T a, Args... args) {
  cerr << *it << " = " << a << '\n';
  err(++it, args...);
}
struct point {
  int x, y;
  double len() { return sqrt(x * x + y * y); }
  double angel() { return atan2(y, x); }
  point operator+(const point &o) { return {x + o.x, y + o.y}; }
  point operator*(const int d) { return {x * d, y * d}; }
  int operator*(const point &o) { return x * o.x + y * o.y; }
  int operator^(const point &o) { return x * o.y - y * o.x; }
};
const int maxn = (1e6) + 100;
const long long INF = (1e9) + 7;
const long double EPS = 1e-8;
vector<long long> e[maxn];
bool was[maxn];
queue<int> qe;
void dfs(int v) {
  qe.push(v);
  while (!qe.empty()) {
    int u = qe.front();
    qe.pop();
    was[u] = 1;
    for (int i = 0; i < (int)e[u].size(); i++)
      if (!was[e[u][i]]) {
        qe.push(e[u][i]);
        was[e[u][i]] = 1;
      }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  long long p = 0;
  for (int i = 0; i < (int)m; i++) {
    int x, y;
    cin >> x >> y;
    if (x == y) {
      p++;
      continue;
    }
    e[x].push_back(y);
    e[y].push_back(x);
  }
  int j = 1;
  while (e[j].size() == 0 && j <= n) j++;
  if (j == n + 1) {
    cout << 0;
    return 0;
  }
  dfs(j);
  int cnt = 0;
  for (int i = 1; i <= (int)n; i++)
    if (!was[i]) {
      cnt++;
    }
  long long ans = 0;
  int k = 0;
  for (int i = 1; i <= (int)n; i++) {
    long long q = (long long)e[i].size();
    if (q == 0) k++;
    ans += q * (q - 1);
  }
  if (cnt != k) {
    cout << 0;
    return 0;
  }
  ans += p * (p - 1);
  ans /= 2;
  ans += p * (m - p);
  cout << ans;
  return 0;
}
