import math
import itertools

N,M=map(int,input().split())
s=[[0,0,0]]+[list(map(int,input().split())) for _ in range(M)]
n=math.factorial(N)
l=list(itertools.permutations(range(N)))
d=[[0 for _ in range(n)] for _ in range(M+1)]

for i in range(1,M+1):
    for j in range(n):
        if list(l[j]).index(s[i][0])<list(l[j]).index(s[i][1]):
            d[i][j]=d[i-1][j]+s[i][2]

print(max(d[M]))