N, M = [int(i) for i in input().split()]
scores = [[0]*N for _ in range(N)]
dp = {}

for i in range(M):
    it_1, it_2, s = map(int, input().split())
    scores[it_1][it_2] = s

def solve(used, rest):
    if len(rest) == 0:
        return 0

    if tuple(rest) in dp:
        return dp[tuple(rest)]
    else:
        candidates = []
        for i in rest:
            plus = 0
            for j in used:
                plus += scores[i][j]
            rest_cp = rest[:]
            rest_cp.remove(i)
            used_cp = used[:]
            used_cp.append(i)
            plus += solve(used_cp, rest_cp)
            candidates.append(plus)
        dp[tuple(rest)] = max(candidates)
        return dp[tuple(rest)]

print(solve([], list(range(N))))