from itertools import permutations

n, m = map(int, input().split())
C = [[-1 for _ in range(n)] for _ in range(n)]
for _ in range(m):
    i, j, c = map(int, input().split())
    C[i][j] = c

ans = 0
for P in permutations(range(n)):
    res = 0
    for i in range(len(P) - 1):
        if C[P[i]][P[i + 1]] != -1:
            res += C[P[i]][P[i + 1]]
    ans = max(ans, res)
print(ans)