3 3
1 2
3 1
2 3
 2 0
 10 17
1 2
1 3
1 4
1 5
1 6
1 7
1 8
1 9
1 10
2 3
3 4
4 5
5 6
6 7
7 8
8 9
9 10
 2 1
1 2
 8 13
1 2
2 3
3 4
4 1
2 4
1 3
5 6
6 7
7 8
8 5
6 8
5 7
1 8
 3 2
1 2
2 3
 10 9
1 2
1 3
1 4
1 5
1 6
1 7
1 8
1 9
1 10
 10 40
1 3
2 6
9 10
4 6
1 2
1 8
6 10
3 6
1 4
5 7
3 8
3 9
4 5
3 7
8 9
5 9
5 6
2 3
3 4
1 6
4 8
3 10
5 10
2 8
2 10
4 7
1 10
1 7
4 10
5 8
8 10
7 9
6 8
2 7
4 9
6 9
7 8
6 7
1 5
2 9
 10 9
1 2
2 3
3 1
4 5
5 6
6 7
7 4
4 6
5 7
 1000000 0
 8 11
1 2
1 3
1 4
2 3
2 7
7 4
4 2
7 5
8 1
1 7
7 8
 9 9
1 2
2 3
3 1
4 5
5 6
6 4
7 8
8 9
9 7
 15 14
1 2
1 3
1 4
1 5
2 6
2 7
7 8
7 9
3 10
10 11
4 12
12 13
13 14
13 15
 10 17
1 2
1 3
1 4
1 5
1 6
1 7
1 8
1 9
1 10
2 3
2 4
2 5
2 6
2 7
2 8
2 9
2 10
 9 12
1 2
2 3
3 1
1 4
4 5
5 1
1 6
6 7
7 1
1 8
8 9
9 1
 3 1
1 2
 10 5
5 7
4 8
9 10
7 10
6 10
 15 15
1 2
1 3
1 4
1 5
2 6
2 7
7 8
7 9
3 10
10 11
4 12
12 13
13 14
13 15
15 1
 4 3
1 2
2 3
3 1
 10 30
4 9
4 6
1 2
8 10
7 8
4 7
1 8
6 7
5 6
1 5
7 9
1 7
8 9
7 10
9 10
3 9
2 7
5 7
5 9
2 8
2 9
5 8
3 10
1 6
3 6
2 10
6 8
3 4
2 5
4 5
 4 3
1 2
1 3
1 4
 4 6
1 2
2 3
3 4
4 1
1 3
2 4
 10 9
1 2
1 3
1 4
2 5
5 6
2 7
3 8
3 9
9 10
 10 10
1 2
2 3
3 4
4 5
5 6
6 7
7 8
8 9
9 10
10 1
 3 0
 6 6
1 2
2 3
3 1
4 5
5 6
6 4
 10 0
 9 15
1 2
2 3
3 1
1 4
4 5
5 1
1 6
6 7
7 1
1 8
8 9
9 1
2 9
7 4
2 8
 4 0
 1 0

1
 0
 43
 0
 8
 0
 84
 82
 63
 166666166667000000
 21
 30
 292
 64
 36
 0
 84
 284
 1
 37
 1
 4
 59
 50
 1
 2
 120
 28
 4
 0

#include <bits/stdc++.h>
using namespace std;
const int N = 1000005;
struct edge {
  int u, v, pre;
} E[N * 2];
int head[N], cnt;
void add_edge(int u, int v) {
  E[cnt].u = u;
  E[cnt].v = v;
  E[cnt].pre = head[u];
  head[u] = cnt++;
}
long long res;
long long n, m;
bool vis[N];
void gao(int pre, int u) {
  vis[u] = true;
  for (int i = head[u]; i != -1; i = E[i].pre) {
    int v = E[i].v;
    if (v != pre && !vis[v]) {
      for (int j = head[v]; j != -1; j = E[j].pre) {
        int vk = E[j].v;
        if (vk == pre) res++, gao(u, v);
      }
    }
  }
}
long long de[N];
int main() {
  while (~scanf("%I64d %d", &n, &m)) {
    res = 0;
    cnt = 0;
    memset(head, -1, sizeof(head));
    memset(vis, false, sizeof(vis));
    memset(de, 0, sizeof(de));
    while (m--) {
      int u, v;
      scanf("%d%d", &u, &v);
      de[u]++;
      de[v]++;
      add_edge(u, v);
      add_edge(v, u);
    }
    for (int i = 1; i <= n; i++) {
      if (!vis[i] && head[i] != -1) {
        vis[i] = true;
        for (int j = head[i]; j != -1; j = E[j].pre) {
          int v = E[j].v;
          if (!vis[v]) {
            gao(i, v);
          }
        }
      }
    }
    m = 0;
    for (int i = 1; i <= n; i++)
      if (vis[i]) m++;
    long long qq = m - 1;
    long long q = 0;
    for (int i = 1; i <= n; i++)
      if (de[i] != 0 && de[i] < qq) q++;
    long long p = n - m;
    if (p >= 3) res += p * (p - 1) * (p - 2) / 6;
    if (p >= 1 && qq >= 2) res += p * q * (q - 1) / 2;
    if (p >= 2 && m >= 1) res += p * (p - 1) * m / 2;
    printf("%I64d\n", res);
  }
  return 0;
}
