import sys
input=sys.stdin.readline

N,M=map(int,input().split())
D=[[0 if i==j else 10000 for j in range(N)] for i in range(N)]

for _ in range(M):
    a,b=map(int,input().split())
    D[a-1][b-1]=D[b-1][a-1]=1

for k in range(N):
    Dk=D[k]
    for i in range(N):
        Di=D[i]
        for j in range(N):
            Di[j]=min(Di[j],Di[k]+Dk[j])

X=0
for i in range(N):
    for j in range(i+1,N):
        for k in range(j+1,N):
            if D[i][j]!=2 and D[j][k]!=2 and D[k][i]!=2:
                X+=1

print(X)