N,M=map(int,input().split())
point=[[0 for _ in range(N)] for _ in range(N)]
for _ in range(M):
    t1,t2,p=map(int,input().split())
    point[t2][t1]=p

MAX=1<<N
dp=[[0 for _ in range(N)] for _ in range(MAX)]
for s in range(1,MAX):
    for frm in range(N):
        if s&(1<<frm)==0:continue
        for to in range(N):
            if s&(1<<to)==0:continue
            bs=s^(1<<to)
            p=0
            for i in range(N):
                if bs&(1<<i)>0:p+=point[to][i]
            dp[s][to]=max(dp[s][to],dp[bs][frm]+p)
ans=max(dp[-1])
print(ans)