n, m = map(int, input().split())
inf = 10 ** 18
B = [[inf] * n for _ in range(n)]
for _ in range(m):
    a, b = map(int, input().split())
    a -= 1
    b -= 1
    B[a][b] = 1
    B[b][a] = 1

for k in range(n):
    for i in range(n):
        for j in range(n):
            B[i][j] = min(B[i][j], B[i][k] + B[k][j])

ans = n * (n - 1) * (n - 2) // 6

for i in range(n):
    for j in range(i + 1, n):
        for k in range(j + 1, n):
            if B[i][j] == 2 or B[j][k] == 2 or B[k][i] == 2:
                ans -= 1

print(ans)