import sys

sys.setrecursionlimit(10 ** 6)
from bisect import *
from collections import *
from heapq import *

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

def main():
    n,m=MI()
    ss=[[0]*n for _ in range(n)]
    for _ in range(m):
        i1,i2,s=MI()
        ss[i1][i2]=s
    dp=[0]*(1<<n)
    for bit in range(1<<n):
        for i in range(n):
            if bit>>i&1:continue
            nbit=bit|1<<i
            dp[nbit]=max(dp[nbit],dp[bit]+sum(ss[j][i] for j in range(n) if bit>>j&1))
    print(dp[-1])

main()