import itertools

n,m = input().split()
n,m = int(n),int(m)

lst = []
allpoint = 0
for i in range(m):
    l = list(map(int,input().split()))
    lst.append([l[2]]+l[:2])
    allpoint += l[2]
lst.sort()
lst.reverse()
l = list(range(n))

minpoint = allpoint

for a in list(itertools.permutations(l)):
    nowpoint = 0
    for b in lst:
        if a[b[1]]<a[b[2]]:
            nowpoint += b[0]
            if nowpoint>minpoint:
                break
    else:
        minpoint = min(minpoint,nowpoint)

print(allpoint-minpoint)