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>
#pragma comment(linker, "/STACK:1000000000")
using namespace std;
const int MAXN = 2000001;
vector<int> vs;
bool w[MAXN];
pair<int, int> e[MAXN];
vector<int> e2[MAXN];
int n, m;
bool ex(int a, int b) {
  pair<int, int> p = make_pair(min(a, b), max(a, b));
  return ((*lower_bound(e, e + m, p)) == p);
}
vector<int> nch2;
vector<int> nch3;
int cn[MAXN];
void dfs(int v) {
  w[v] = true;
  for (int i = 0; i < e2[v].size(); i++) {
    if (!w[e2[v][i]]) dfs(e2[v][i]);
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  scanf("%d%d", &n, &m);
  memset(w, 0, sizeof(w));
  int loops = 0;
  for (int i = 0; i < m; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
    if (a == b) loops++;
    e2[a].push_back(b);
    e2[b].push_back(a);
    e[i] = make_pair(min(a, b), max(a, b));
  }
  vector<int> nch;
  for (int i = 1; i <= n; i++) {
    if (e2[i].size() > 0) {
      dfs(i);
      break;
    }
  }
  for (int i = 1; i <= n; i++) {
    if ((e2[i].size() > 0) && (!w[i])) {
      cout << 0 << endl;
      return 0;
    }
    if ((e2[i].size() & 1) && (nch.size() < 8)) nch.push_back(i);
    cn[i] = e2[i].size();
  }
  long long ans = 0;
  for (int i = 0; i < m; i++) {
    nch2 = nch;
    cn[e[i].first]--;
    cn[e[i].second]--;
    if (e[i].first == e[i].second) loops--;
    nch.push_back(e[i].first), nch.push_back(e[i].second);
    sort(nch.begin(), nch.end());
    nch.resize(unique(nch.begin(), nch.end()) - nch.begin());
    nch3 = nch;
    nch.clear();
    for (int i = 0; i < nch3.size(); i++)
      if (cn[nch3[i]] % 2 == 1) nch.push_back(nch3[i]);
    if (nch.size() == 0) {
      ans += loops;
    } else if (nch.size() == 2) {
      if (ex(nch[0], nch[1])) ans++;
      ans += loops;
    } else if (nch.size() == 4) {
      for (int i = 0; i < 4; i++)
        for (int j = i + 1; j < 4; j++)
          if (ex(nch[i], nch[j])) ans++;
    }
    nch = nch2;
    if (e[i].first == e[i].second) loops++;
    cn[e[i].first]++;
    cn[e[i].second]++;
  }
  ans /= 2;
  if (nch.size() == 0) ans -= m;
  cout << ans << endl;
  return 0;
}
