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 L, class R>
ostream &operator<<(ostream &os, pair<L, R> P) {
  return os << "(" << P.first << "," << P.second << ")";
}
template <class T>
ostream &operator<<(ostream &os, vector<T> V) {
  os << "[";
  for (auto vv : V) os << vv << ",";
  return os << "]";
}
template <class TH>
void _dbg(const char *sdbg, TH h) {
  cerr << sdbg << '=' << h << '\n';
}
template <class TH, class... TA>
void _dbg(const char *sdbg, TH h, TA... a) {
  while (*sdbg != ',') cerr << *sdbg++;
  cerr << '=' << h << ',';
  _dbg(sdbg + 1, a...);
}
const long long N = 1e6 + 7;
long long n, m, deg[N];
struct UNF {
  vector<long long> par, sz;
  UNF(long long n) {
    par.resize(n);
    sz.resize(n);
    for (long long i = 0; i < n; i++) make_set(i);
  }
  void make_set(long long v) { par[v] = v, sz[v] = 1; }
  long long find_set(long long v) {
    if (v == par[v]) return v;
    return par[v] = find_set(par[v]);
  }
  void union_sets(long long u, long long v) {
    u = find_set(u);
    v = find_set(v);
    if (u != v) {
      if (sz[u] < sz[v]) swap(u, v);
      par[v] = u;
      sz[u] += sz[v];
    }
  }
};
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  cin >> n >> m;
  UNF uf(n + 1);
  long long start = -1, sl = 0;
  set<long long> nodes;
  vector<pair<long long, long long> > edges;
  for (long long i = 0; i < m; i++) {
    long long a, b;
    cin >> a >> b;
    if (a == b) {
      sl++;
      continue;
    }
    edges.push_back(make_pair(a, b));
    if (start == -1) start = a;
    nodes.insert(a), nodes.insert(b);
    deg[a]++, deg[b]++;
    uf.union_sets(a, b);
  }
  if (uf.sz[uf.find_set(start)] != nodes.size()) {
    cout << 0 << '\n';
  } else {
    long long ans = 0;
    for (auto e : edges) {
      ans += deg[e.first] - 1;
      if (e.second != e.first) ans += deg[e.second] - 1;
    }
    ans /= 2;
    ans += sl * (m - sl);
    cout << ans << '\n';
  }
  return 0;
}
