# import sys; input = sys.stdin.buffer.readline
# sys.setrecursionlimit(10**7)
from collections import defaultdict
con = 10 ** 9 + 7; INF = float("inf")

def getlist():
	return list(map(int, input().split()))

def warshall_floyd(d, N):
	for k in range(N):
		for i in range(N):
			for j in range(N):
				d[i][j] = min(d[i][j],d[i][k] + d[k][j])
	return d

#処理内容
def main():
	N, M = getlist()
	L = []
	for i in range(M):
		a, b = getlist()
		a -= 1; b -= 1
		a, b = list(sorted([a, b]))
		L.append((a, b))
	L = list(set(L))
	# print(L)

	d = [[INF for i in range(N)] for j in range(N)]
	for a, b in L:
		d[a][b] = 1
		d[b][a] = 1

	for i in range(N):
		d[i][i] = 0

	d = warshall_floyd(d, N)

	ans = 0
	for i in range(N):
		for j in range(i + 1, N):
			for k in range(j + 1, N):
				if not 2 in (d[i][j], d[j][k], d[k][i]):
					ans += 1

	print(ans)

if __name__ == '__main__':
	main()