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 = 1e6 + 5;
int V[N], Next[N], use[N], tmd[N], tot, cnt, head[N], vis[N], bridge[N], dfn[N],
    low[N], pre[N], size[N];
void add(int u, int v) {
  V[tot] = v;
  use[tot] = 0;
  Next[tot] = head[u];
  head[u] = tot++;
}
void init() {
  tot = cnt = 0;
  memset(head, -1, sizeof(head));
  memset(vis, 0, sizeof(vis));
  memset(bridge, 0, sizeof(bridge));
  memset(size, 0, sizeof(vis));
  memset(tmd, 0, sizeof(tm));
}
void tarjan(int u) {
  vis[u] = 1;
  dfn[u] = low[u] = cnt++;
  for (int i = head[u]; i != -1; i = Next[i]) {
    if (!use[i]) {
      use[i] = use[i ^ 1] = 1;
      int v = V[i];
      if (!vis[v]) {
        pre[v] = u;
        tarjan(v);
        low[u] = min(low[u], low[v]);
        if (dfn[u] < low[v]) {
          bridge[v] = 1;
        }
      } else if (vis[v] == 1)
        low[u] = min(low[u], dfn[v]);
    }
  }
  vis[u] = 2;
}
void dfs(int u) {
  vis[u] = 1;
  for (int i = head[u]; i != -1; i = Next[i]) {
    int v = V[i];
    if (!vis[v]) dfs(v);
  }
}
long long ans = 0, sum = 0, ans1 = 0;
void dfs1(int u) {
  vis[u] = 1;
  for (int i = head[u]; i != -1; i = Next[i]) {
    if (!vis[V[i]]) dfs1(V[i]);
  }
  for (int i = head[u]; i != -1; i = Next[i]) {
    int v = V[i];
    if (bridge[i] &&
        ((size[u] > 1 && size[v] > 1) || (tmd[u] == 1 && tmd[v] == 1)))
      use[i] = use[i ^ 1] = 1;
  }
}
int vis1[N] = {0};
void dfs2(int u) {
  vis[u] = 1;
  for (int i = head[u]; i != -1; i = Next[i]) {
    if (!vis[V[i]]) dfs2(V[i]);
  }
  long long tmp = 0;
  for (int i = head[u]; i != -1; i = Next[i]) {
    if (use[i]) continue;
    tmp++;
    if ((size[u] > 1 || tmd[u]) && !vis1[i]) {
      vis1[i] = vis1[i ^ 1] = 1;
      ans1 += sum;
    }
  }
  if (tmp) ans += tmp * (tmp - 1LL) / 2LL;
}
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  init();
  for (int i = 1; i <= m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    if (u == v) {
      tmd[u] = 1;
      continue;
    }
    add(u, v);
    add(v, u);
    size[u]++;
    size[v]++;
  }
  dfs(1);
  for (int i = 1; i <= n; i++)
    if (!vis[i]) {
      printf("0\n");
      exit(0);
    }
  memset(vis, 0, sizeof(vis));
  tarjan(1);
  memset(vis, 0, sizeof(vis));
  memset(use, 0, sizeof(use));
  dfs1(1);
  memset(vis, 0, sizeof(vis));
  for (int i = 1; i <= n; i++) sum += tmd[i];
  dfs2(1);
  printf("%lld\n", ans + ans1 + sum * (sum - 1LL) / 2LL);
  return 0;
}
