# from : https://yukicoder.me/submissions/165840

N, M =map(int, input().split())
scores = [ [0]*N for _ in range(N)]
for _ in range(M):
    i1,i2, score = map(int,input().split())
    scores[i1][i2] = score

dp = {}

def solve(used, rest):
    global dp
    if len(rest) == 0:
        return 0
    if tuple(rest) in dp:
        return dp[tuple(rest)] 

    candidates = []
    for i in rest:
        plus = 0
        for j in used:
            plus += scores[i][j]
        new_rest = filter(lambda x:x!=i, rest)
        plus += solve(used+[i], new_rest)
        candidates.append(plus)

    dp[tuple(rest)] = max(candidates)
    return dp[tuple(rest)]
print(solve([], list(range(N))))