import itertools

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

# Initialize friend matrix
friend = [[False] * (n + 1) for _ in range(n + 1)]
for _ in range(m):
    a, b = map(int, input().split())
    friend[a][b] = True
    friend[b][a] = True

# Precompute good relationships matrix
good = [[False] * (n + 1) for _ in range(n + 1)]
for u in range(1, n + 1):
    for v in range(u + 1, n + 1):
        if not friend[u][v]:
            # Check if there's any common friend
            common = False
            for k in range(1, n + 1):
                if k != u and k != v and friend[u][k] and friend[v][k]:
                    common = True
                    break
            if common:
                good[u][v] = good[v][u] = True

# Count valid triplets
count = 0
for trio in itertools.combinations(range(1, n + 1), 3):
    a, b, c = trio
    if not good[a][b] and not good[a][c] and not good[b][c]:
        count += 1

print(count)