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;
class graph {
 public:
  vector<vector<int> > mMap;
  int mNumber;
  graph(int n) {
    mNumber = n;
    for (int i = 0; i < n; i++) {
      mMap.push_back(vector<int>());
      for (int j = 0; j < n; j++) {
        mMap[i].push_back(0);
      }
    }
  }
  void addEdge(int s, int t, int weight, bool bidirectional) {
    if (bidirectional) {
      mMap[s][t] = weight;
      mMap[t][s] = weight;
    } else {
      mMap[s][t] = weight;
    }
  }
  bool isConnected() {
    set<int> visited;
    visited.clear();
    dfsTraverse(0, visited);
    return mNumber == visited.size();
  }

 private:
  void dfsTraverse(int current, set<int> &visited) {
    if (visited.find(current) == visited.end()) {
      visited.insert(current);
      for (int i = 0; i < mNumber; i++) {
        if (mMap[current][i] > 0) {
          dfsTraverse(i, visited);
        }
      }
    }
  }
};
void print_vector(vector<int> v) {
  for (int i = 0; i < v.size(); i++) {
    cout << v[i] << " ";
  }
  cout << "\n";
}
void print_arr(int v[], int size) {
  for (int i = 0; i < size; i++) {
    cout << v[i] << " ";
  }
  cout << "\n";
}
int main() {
  int n = 0, m = 0;
  int s = 0, t = 0, w = 0;
  int selfEdgeCounter = 0;
  int connectEdgeCounter = 0;
  cin >> n >> m;
  vector<int> degree(n, 0);
  graph g = graph(n);
  for (int i = 0; i < m; i++) {
    cin >> s >> t;
    s--;
    t--;
    if (g.mMap[s][t] == 0) {
      g.addEdge(s, t, 1, true);
      if (s == t) {
        selfEdgeCounter++;
      } else {
        connectEdgeCounter++;
        degree[s]++;
        degree[t]++;
      }
    }
  }
  if (g.isConnected()) {
    int possible1 = (selfEdgeCounter * (selfEdgeCounter - 1)) / 2;
    int possible2 = selfEdgeCounter * connectEdgeCounter;
    int possible3 = 0;
    for (int i = 0; i < m; i++) {
      if (degree[i] >= 2) {
        possible3 += degree[i] * (degree[i] - 1) / 2;
      }
    }
    if (n == 4) {
      cout << possible1;
      cout << possible2;
      cout << possible3;
    }
    cout << possible1 + possible2 + possible3;
  } else {
    cout << 0;
  }
  return 0;
}
