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

# Initialize adjacency list for friends
adj = [set() for _ in range(n + 1)]
for _ in range(m):
    a, b = map(int, input().split())
    adj[a].add(b)
    adj[b].add(a)

# Initialize good relationship 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 v in adj[u]:
            continue  # They are friends, no good relationship
        # Check mutual friends
        friends_u = adj[u]
        friends_v = adj[v]
        if len(friends_u & friends_v) > 0:
            good[u][v] = True
            good[v][u] = True  # For easy lookup

count = 0

# Iterate over all possible trios
for i in range(1, n + 1):
    for j in range(i + 1, n + 1):
        if good[i][j]:
            continue  # Skip if i and j have a good relationship
        for k in range(j + 1, n + 1):
            if not good[i][k] and not good[j][k]:
                count += 1

print(count)