N,M=map(int,input().split())
D=[[int(i==j)*2 for i in range(N)]for j in range(N)]
#for d in D:print(*d)
for _ in range(M):
    a,b=(x for x in map(int,input().split()))
    D[a][b]=D[b][a]=1
#for d in D:print(*d)

G={}
for x in D: G[x.index(2)]=[i for i in range(N) if x[i]==1]

#print(G)

ans=0
for k,v in G.items():
    for i in range(len(v)):
        for j in range(i+1,len(v)):
            if D[v[i]][v[j]]==1:continue # v[i] and v[j] makes triangle
            common=set(G[v[i]])&set(G[v[j]])
            if k in common and len(common)==1:continue
#            print(k,v[i],v[j],'common',common)
            for c in common:
                if k==c:continue
                if k not in G[c]:
#                    print('found!',k,c,G[c])
                    ans+=1
                else:
                    continue
#                    print('triangle!',k,c,G[c])
                
print(ans//4)