n, m = map(int, input().split())

A = [set() for i in range(n)]
B = []

for _ in range(m):
    a, b = map(lambda x: int(x) - 1, input().split())
    A[a].add(b)
    A[b].add(a)

for i in range(n):
    S = set()
    for a in A[i]:
        S = S | A[a]
    B.append(S - (A[i] | set([i])))
ans = 0

for i in range(n):
    for j in range(i + 1, n):
        for k in range(j + 1, n):
            FF = B[i] | B[j] | B[k]
            if not i in FF and not j in FF and not k in FF:
                ans += 1
print(ans)