N, M = map(int, input().split())
S = 1 << N
items = []
score = [[0]*N for _ in range(N)]
for _ in range(M):
    i, j, s = map(int, input().split())
    score[i][j] = s
dp = [[0]*N for _ in range(S)]
pows = set()
for i in range(N):
    pows.add(pow(2, i))

for s in range(S):
    for u in range(N):
        if not (s >> u) and s != 0:
            continue
        for v in range(N):
            if (s | (1 << v)) in pows:
                continue
            if s & (1 << v):
                continue
            if dp[s | (1 << v)][v] < dp[s][u]+score[v][u]:
                dp[s | (1 << v)][v] = dp[s][u]+score[v][u]
print(max(dp[S-1]))