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 N = 100000 + 7;
const int M = 20;
const int inf = 1e9 + 7;
const long long linf = 1e18 + 7;
const double pi = acos(-1);
const double eps = 1e-7;
const bool multipleTest = 0;
int n, m;
vector<int> adj[N];
int cycle[N];
int nonEdge[N];
long long ans = 0;
vector<int> nxt[N];
int pa[N];
int sumCycle = 0;
int sumNon = 0;
void dfs(int u, int r) {
  for (int& v : adj[u]) {
    if (v == u) {
      cycle[u]++;
      continue;
    }
    if (v != r) {
      if (pa[v] == 0) {
        nxt[u].push_back(v);
        pa[v] = u;
        dfs(v, u);
      } else {
        nonEdge[u]++;
        sumNon++;
      }
    }
  }
}
long long f(long long x) { return x * (x - 1) / 2; }
void solve() {
  cin >> n >> m;
  for (int j = (0); j < (m); j++) {
    int u, v;
    scanf("%d%d", &u, &v);
    adj[u].push_back(v);
    adj[v].push_back(u);
    if (u == v) sumCycle++;
  }
  bool has = false;
  for (int i = 1; i <= n; ++i) {
    if (adj[i].size() > 0 && pa[i] == 0) {
      pa[i] = -1;
      if (has) {
        puts("0");
        return;
      }
      has = 1;
      dfs(i, pa[i]);
    }
  }
  ans += 1ll * sumCycle * (m - 1);
  for (int i = 1; i <= n; ++i) {
    if (pa[i] == 0) continue;
    ans += f(nonEdge[i]);
    for (int& v : nxt[i]) {
      ans += nxt[v].size();
    }
    ans += f(nxt[i].size());
    ans += 1ll * nonEdge[i] * nxt[i].size();
    if (pa[i] != -1) ans += nonEdge[i];
  }
  cout << ans << '\n';
}
int main() {
  int Test = 1;
  if (multipleTest) {
    cin >> Test;
  }
  for (int i = 0; i < Test; ++i) {
    solve();
  }
}
