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 <typename T>
void uin(T &a, T b) {
  if (b < a) {
    a = b;
  }
}
template <typename T>
void uax(T &a, T b) {
  if (b > a) {
    a = b;
  }
}
const long long maxn = 1000 * 1000 + 228;
long long n, m;
map<pair<long long, long long>, long long> cnt;
vector<long long> g[maxn];
long long deg[maxn];
bool used[maxn];
void dfs(long long v) {
  used[v] = 1;
  for (long long to : g[v]) {
    if (!used[to]) {
      dfs(to);
    }
  }
}
void solve() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> m;
  vector<pair<long long, long long> > edges;
  for (long long i = 1; i <= (long long)m; ++i) {
    long long u, v;
    cin >> u >> v;
    edges.push_back({u, v});
    ++cnt[{u, v}];
    if (u != v) {
      ++cnt[{v, u}];
    }
    deg[u] ^= 1;
    deg[v] ^= 1;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  long long comps = 0;
  for (long long i = 1; i <= (long long)n; ++i) {
    if (!used[i]) {
      dfs(i);
      ++comps;
    }
  }
  if (comps > 1 || m == 1) {
    cout << "0\n";
    return;
  }
  long long cnt_odd = 0;
  vector<long long> bad;
  for (long long i = 1; i <= (long long)n; ++i) {
    if (deg[i]) {
      ++cnt_odd;
      bad.push_back(i);
    }
  }
  if (cnt_odd > 4) {
    cout << "0\n";
    return;
  }
  long long res = 0;
  for (long long i = 0; i < (long long)edges.size(); ++i) {
    for (long long j = i + 1; j < (long long)edges.size(); ++j) {
      pair<long long, long long> p1 = edges[i], p2 = edges[j];
      long long u1 = p1.first, v1 = p1.second;
      long long u2 = p2.first, v2 = p2.second;
      vector<long long> inter = bad;
      inter.push_back(u1);
      inter.push_back(u2);
      inter.push_back(v1);
      inter.push_back(v2);
      sort(inter.begin(), inter.end());
      inter.erase(unique(inter.begin(), inter.end()), inter.end());
      deg[u1] ^= 1;
      deg[u2] ^= 1;
      deg[v1] ^= 1;
      deg[v2] ^= 1;
      long long c = 0;
      for (long long i : inter) {
        if (deg[i] & 1) {
          ++c;
        }
      }
      if (c <= 2) {
        ++res;
      }
    }
  }
  cout << res << endl;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  solve();
  return 0;
}
