N, M = map(int, raw_input().split())
sequence = [[]]
memo = []
while sequence != []:
	now = sequence.pop(0)
	if len(now) == N: memo.append(now)
	else:
		for i in range(0, N):
			newseq = []
			for j in range(0, len(now)):
				newseq.append(now[j])
			if i not in newseq:
				newseq.append(i)
				sequence.append(newseq)
pointlist = []
for i in range(0, M):
	pointlist.append(map(int, raw_input().split()))
max = 0
for i in range(0, len(memo)):
	sum = 0
	for j in range(0, M):
		if memo[i][pointlist[j][0]] < memo[i][pointlist[j][1]]:
			sum += pointlist[j][2]
	if max < sum: max = sum
print max