n,m=map(int,input().split())
g=[[n*2]*n for _ in range(n)]
for _ in range(m):
    a=list(map(int,input().split()))
    g[a[0]-1][a[1]-1]=1
    g[a[1]-1][a[0]-1]=1
for k in range(n):
    for i in range(n):
        for j in range(n):
            g[i][j]=min(g[i][j],g[i][k]+g[k][j])
ans=0
for i in range(n):
    for j in range(i):
        if g[i][j]==2:continue
        for k in range(j):
            if g[j][k]==2 or g[k][i]==2 :continue
            ans+=1
print(ans)