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>
const double PI = acos(-1.0);
using namespace std;
long long bigmod(long long b, long long p) {
  if (p == 0) return 1;
  long long my = bigmod(b, p / 2);
  my *= my;
  my %= 1000000007;
  if (p & 1) my *= b, my %= 1000000007;
  return my;
}
int setb(int n, int pos) { return n = n | (1 << pos); }
int resb(int n, int pos) { return n = n & ~(1 << pos); }
bool checkb(int n, int pos) { return (bool)(n & (1 << pos)); }
long long n, m;
vector<long long> g[2000005];
bool visit[2000005];
long long c;
void dfs(long long u) {
  visit[u] = 1;
  c++;
  long long len = g[u].size(), i;
  for (i = 0; i < len; i++) {
    long long v = g[u][i];
    if (visit[v] == 0) {
      dfs(v);
    }
  }
}
int main() {
  long long i, x, y;
  scanf("%lld %lld", &n, &m);
  for (i = 1; i <= m; i++) {
    scanf("%lld %lld", &x, &y);
    g[x].push_back(y);
    if (x == y) continue;
    g[y].push_back(x);
  }
  long long cp = 0;
  for (i = 1; i <= n; i++) {
    if (visit[i] == 0) {
      c = 0;
      dfs(i);
      if (c == 1) {
        if (g[i].size() == 1) cp++;
      } else {
        cp++;
      }
    }
  }
  if (cp > 1) {
    puts("0");
    return 0;
  }
  long long ret = 0;
  for (i = 1; i <= n; i++) {
    long long u = i;
    long long len = g[u].size(), j;
    long long cnt = 0;
    for (j = 0; j < len; j++) {
      long long v = g[u][j];
      if (u == v) {
        cnt++;
        continue;
      }
      long long s = g[v].size();
      if (s == 1) cnt++;
    }
    ret += ((cnt * (cnt - 1)) / 2);
  }
  printf("%lld", ret);
  printf("\n");
  return 0;
}
