import sys
sys.setrecursionlimit(10000000)
MOD = 10 ** 9 + 7
INF = 10 ** 15

from itertools import permutations,product,combinations_with_replacement,groupby,accumulate,combinations
def main():
    N,M = map(int,input().split())
    G = [[0]*N for _ in range(N)]
    for _ in range(M):
        a,b = map(int,input().split())
        a -= 1
        b -= 1
        G[a][b] = 1
        G[b][a] = 1
    
    ans = 0
    judge = lambda x,y,z,w: G[x][y] and G[y][z] and G[z][w] and G[w][x] and (not G[x][z]) and (not G[y][w])
    for i in range(N):
        for j in range(i + 1,N):
            for k in range(j + 1,N):
                for l in range(k + 1,N):
                    for ptr in permutations((j,k,l)):
                        if judge(i,ptr[0],ptr[1],ptr[2]):
                            ans += 1
                            break
    print(ans)
if __name__ == '__main__':
    main()