from operator import itemgetter
from itertools import *
from bisect import *
from collections import *
from heapq import *
import sys

sys.setrecursionlimit(10 ** 6)

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

n,m=MI()
to=[[] for _ in range(n)]
ee=[[False]*n for _ in range(n)]
for _ in range(m):
    u,v=MI()
    to[u].append(v)
    to[v].append(u)
    ee[u][v]=ee[v][u]=True

ans=0
for u in range(n):
    ab=to[u]
    an=len(ab)
    for i in range(an):
        a=ab[i]
        for j in range(i):
            b=ab[j]
            if ee[a][b]:continue
            for v in range(n):
                if v==u:continue
                if ee[a][v] and ee[b][v] and not ee[u][v]:
                    ans+=1
                    # print(u,v,a,b,i,j)

print(ans//4)