import sequtils,strutils,algorithm,math

type
    item = tuple[a, b, score : int]
var
    N,M,a,b,c : int
    p : item
(N,M) = stdin.readline.split.map(parseInt)
var
    Items = newSeq[item](0)
    nodes = newSeq[int](N)
    ans : int
    
for n in 0..<N:
    nodes[n] = n
for m in 1..M:
    (a,b,c) = stdin.readline.split.map(parseInt)
    Items.add((a,b,c))
proc index[T](A : openarray[T], a:T) : int =
    for i in 0..A.high:
        if A[i] == a:
            return i
    return -1


proc sum_score(): int =
    for t in Items:
        if nodes.index(t.a) < nodes.index(t.b):
            result += t.score

ans = sum_score()
while nodes.nextPermutation:
    ans = max(sum_score(), ans)

echo ans