from itertools import combinations
N, M = map(int, input().split())
G = [[False] * (N) for _ in range(N)]
for i in range(M):
    a, b = map(int, input().split())
    a -= 1
    b -= 1
    G[a][b] = True
    G[b][a] = True

# 友達の友達
fof = [[False] * (N) for _ in range(N)]

# 仲介となる人間を全探索
for i in range(N):
    for j in range(N):
        if j == i:
            continue
        if not G[i][j]:
            continue
        for k in range(j + 1, N):
            if k == i:
                continue
            if not G[i][k]:
                continue
            # (j, k) は友達の友達である
            # ただし、j,k が直接友達だったら除外する
            if not G[j][k]:
                fof[j][k] = True
                fof[k][j] = True
ans = 0
for i, j, k in combinations([i for i in range(N)], 3):
    if (not fof[i][j]) and (not fof[j][k]) and (not fof[k][i]):
        ans += 1
print(ans)