import sys

def resolve():
    inp = int2d()
    n,m = inp[0]
    graph = [[0]*n for _ in range(n)]
    for item1,item2,score in inp[1:]:
        graph[item1][item2] = score

    #bit, last vertex
    dp = [[0]*n for _ in range(1<<n)]
    for bit in range(1<<n):
        for vertex in range(n):
            if not(bit & 1<<vertex): continue
            if bit == 1<<vertex: break

            prebit = bit ^ 1<<vertex
            delta = 0
            for shift in range(n):
                if prebit & 1<<shift: delta += graph[shift][vertex]
            
            dp[bit][vertex] = max(dp[prebit]) + delta

    print(max(dp[-1]))

def str1d():return sys.stdin.read().splitlines()
def int2d():return [list(map(int,s.split())) for s in str1d()]

resolve()