from itertools import combinations
n,m=map(int,input().split())
inf=float('inf')
d=[[inf]*n for _ in range(n)]
for i in range(n):
    d[i][i]=0
for _ in range(m):
    a,b=map(int,input().split())
    a-=1;b-=1
    d[a][b]=d[b][a]=1
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])
ans=0
for seq in combinations(range(n),3):
    x,y,z=seq
    if d[x][y]!=2 and d[y][z]!=2 and d[z][x]!=2:
        ans+=1
print(ans)