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;
const int inf = (int)1e9;
const double eps = (double)1e-8;
const int mod = (int)1e9 + 7;
const int maxn = (int)1e6 + 5;
long long n, m, u, v, kp, k, ans;
long long l;
vector<int> a[maxn];
int t[maxn];
void dfs(int v) {
  if (t[v]) return;
  t[v] = 1;
  --l;
  int to = 0;
  k += (int)a[v].size();
  for (int i = (0); i < (a[v].size()); ++i) {
    to = a[v][i];
    dfs(to);
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m;
  kp = 0;
  l = 0;
  for (int i = (1); i <= (m); ++i) {
    cin >> u >> v;
    if (!t[u]) ++l;
    t[u] = 1;
    if (!t[v]) ++l;
    t[v] = 1;
    if (u == v) {
      ++kp;
      continue;
    }
    a[u].push_back(v);
    a[v].push_back(u);
  }
  ans = kp * (kp - 1) / 2 + kp * (m - kp);
  m -= kp;
  for (int i = (1); i <= (n); ++i) {
    if (a[i].size() != 0) {
      k = 0;
      memset((t), 0, sizeof(t));
      dfs(i);
      k /= 2;
      cout << l << "\n";
      if (k != m || l != 0) {
        cout << 0 << "\n";
        return 0;
      }
      break;
    }
  }
  if (l != 0) {
    cout << 0 << "\n";
    return 0;
  }
  for (int i = (1); i <= (n); ++i) {
    ans += (long long)a[i].size() * ((long long)a[i].size() - 1) / 2;
  }
  cout << ans << "\n";
  return 0;
}
