def dfs(n,pre,scores,used,N):
	if n == N:
		return 0
	ret = 0
	for i in range(N):
		if used[i]:continue
		used[i] = True
		ret = max(ret,dfs(n + 1,i,scores,used,N) + scores[pre][i])
		used[i] = False
	return ret
N,M = map(int,input().split())
scores = [[0 for j in range(N + 1)] for i in range(N + 1)]
used = [False for i in range(N)]
for i in range(M):
	item1,item2,score = map(int,input().split())
	scores[item1][item2] = score
print (dfs(0,N,scores,used,N))