n, m = map(int, input().split())
edges = [set() for _ in range(n)]
for _ in range(m):
    a, b = map(int, input().split())
    edges[a].add(b)
    edges[b].add(a)
    
ans = 0
for i in range(n):
    for j in range(i + 1, n):
        if j in edges[i]:
            continue
        se = edges[i] & edges[j]
        lst = list(se)
        l = len(lst)
        for k in range(l):
            for o in range(k + 1, l):
                if lst[o] not in edges[lst[k]]:
                    ans += 1
print(ans // 2)