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;
template <class T>
inline T sqr(const T &a) {
  return a * a;
}
template <class T>
inline int len(const T &c) {
  return static_cast<int>(c.size());
}
template <class T>
inline bool maximize(T &r, const T c) {
  if (r < c) {
    r = c;
    return true;
  }
  return false;
}
template <class T>
inline bool minimize(T &r, const T c) {
  if (r > c) {
    r = c;
    return true;
  }
  return false;
}
const long double EPS = 1e-9;
const long double PI = 2 * acos(0.0);
const int N = 1000100;
vector<int> g[N];
bool need[N];
bool used[N];
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  int start = -1;
  for (int i = 0; i < m; ++i) {
    int x, y;
    scanf("%d%d", &x, &y);
    --x, --y;
    if (start == -1) start = x;
    need[x] = need[y] = true;
    g[x].push_back(y);
    if (x != y) {
      g[y].push_back(x);
    }
  }
  queue<int> q;
  q.push(start);
  used[start] = true;
  while (!q.empty()) {
    int fm = q.front();
    q.pop();
    for (int to : g[fm]) {
      if (!used[to]) {
        used[to] = true;
        q.push(to);
      }
    }
  }
  long long ans = 0;
  for (int i = 0; i < n; ++i) {
    if (need[i] && !used[i]) {
      puts("0");
      return 0;
    }
    long long t = len(g[i]);
    ans += t * (t - 1) / 2;
  }
  cout << ans << endl;
  return 0;
}
