n, m = map(int, input().split())
INF =10**18
d = [[INF]*n for i in range(n)]
for i in range(n):
    d[i][i] = 0
for i in range(m):
    a, b = map(int, input().split())
    a, b = a-1, b-1
    d[a][b] = 1
    d[b][a] = 1

def warshal_floyd(d):
    n = len(d)
    for k in range(n):
        for i in range(n):
            for j in range(n):
                d[i][j] = min(d[i][j], d[i][k]+d[k][j])
    return d

d = warshal_floyd(d)
ans = n*(n-1)*(n-2)//6
for i in range(n-2):
    for j in range(i+1, n-1):
        for k in range(j+1, n):
            if d[i][j] == 2 or d[j][k] == 2 or d[k][i] == 2:
                ans -= 1
print(ans)