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 = 1e9;
const int MOD = 1e9 + 7;
const long long INF64 = 1e18;
const long double EPS = 1e-7;
mt19937 myrand(time(NULL));
const int N = 1000 * 1000 + 13;
int n, m;
vector<int> g[N];
char pl[N];
map<pair<int, int>, int> mt;
bool read() {
  if (scanf("%d%d", &n, &m) != 2) return 0;
  for (int i = 0; i < (n); i++) g[i] = vector<int>();
  memset(pl, 0, sizeof(pl));
  int f, t;
  for (int i = 0; i < (m); i++) {
    scanf("%d%d", &f, &t);
    --f, --t;
    g[t].push_back(f);
    if (f != t)
      g[f].push_back(t);
    else
      pl[t] = 1;
  }
  return 1;
}
set<pair<int, int> > res;
int used[N], cnt;
set<int> cur;
void nv(int v) {
  if (cnt == m - 2 && (int)(cur).size() == 2) {
    res.insert(make_pair(*cur.begin(), *(--cur.end())));
    return;
  }
  for (auto u : g[v])
    if (used[mt[make_pair(v, u)]] == 1) {
      used[mt[make_pair(v, u)]]++;
      cnt++;
      cur.erase(mt[make_pair(v, u)]);
      nv(u);
      used[mt[make_pair(v, u)]]--;
      cur.insert(mt[make_pair(v, u)]);
      --cnt;
    } else if (used[mt[make_pair(v, u)]] == 0) {
      used[mt[make_pair(v, u)]]++;
      cur.insert(mt[make_pair(v, u)]);
      nv(u);
      used[mt[make_pair(v, u)]]--;
      cur.erase(mt[make_pair(v, u)]);
    }
}
void dfs(int v) {
  used[v] = 1;
  cnt += (int)(g[v]).size();
  if (pl[v]) cnt++;
  for (auto u : g[v])
    if (!used[u]) dfs(u);
}
void solve() {
  memset(used, 0, sizeof(used));
  for (int i = 0; i < (n); i++)
    if (!used[i]) {
      cnt = 0;
      dfs(i);
      if (cnt != m * 2) {
        printf("0\n");
        return;
      }
    }
  long long ans = 0;
  for (int i = 0; i < (n); i++)
    ans += (((int)(g[i]).size() - pl[i]) * 1ll *
            ((int)(g[i]).size() - 1 - pl[i])) /
           2;
  int tmp = m - 1;
  for (int i = 0; i < (n); i++)
    if (pl[i]) {
      ans += tmp;
      --tmp;
    }
  printf("%lld\n", ans);
}
int main() {
  while (read()) solve();
  return 0;
}
