#!/usr/bin/env PyPy3

from collections import Counter, defaultdict, deque
import itertools
import re
import math
from functools import reduce
import operator
import bisect
from heapq import *
import functools

mod=10 ** 9 + 7

import sys
input = sys.stdin.readline

n,m=map(int,input().split())
d = [[0] * n for _ in range(n)]
for _ in range(m):
    i1,i2,v=map(int,input().split())
    d[i1][i2] = v
ans = 0
for row in itertools.permutations(range(n),n):
    tmp = 0
    for i in range(n):
        for j in range(i+1,n):
            tmp += d[row[i]][row[j]]
    ans = max(ans,tmp)
print(ans)