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;
vector<int> adj[100006];
bool visited[100006];
int n, m;
int dfs(int s) {
  visited[s] = true;
  for (int i = 0; i < adj[s].size(); ++i) {
    if (visited[adj[s][i]] == false) dfs(adj[s][i]);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n >> m;
  int x, y;
  memset(visited, false, n + 1);
  for (int i = 0; i < m; i++) {
    cin >> x >> y;
    adj[x].push_back(y);
    adj[y].push_back(x);
  }
  if (m < n - 1 || m < 2) {
    cout << 0;
  } else if (m >= n - 1 && m == 2) {
    cout << 1;
  } else if (m >= n && m > 2) {
    int ans = 0;
    for (int i = 1; i <= n; i++) {
      if (adj[i].size() == 1) {
        if (adj[*(adj[i].begin())].size() > 1 &&
            visited[*(adj[i].begin())] == false) {
          int b = adj[*(adj[i].begin())].size() - 1;
          ans += (b) * (b + 1) / 2;
          visited[*(adj[i].begin())] = true;
        }
      } else if (adj[i].size() >= 2) {
        int cnt = 0;
        for (auto it = adj[i].begin(); it != adj[i].end(); it++) {
          if (adj[*it].size() > 1 && visited[*it] == false) {
            int b = adj[*it].size() - 1;
            ans += (b) * (b + 1) / 2;
            visited[*it] = true;
          }
        }
      }
    }
    cout << ans;
  }
  return 0;
}
