#include <bits/stdc++.h>
using namespace std;

#define INF 114514

int main()
{
	int n,m,rin[9][9];
	for (int i = 0; i < 9; ++i)
	{
		for (int j = 0; j < 9; ++j)
		{
			rin[i][j] = 0;
		}
	}
	cin >> n >> m;
	for (int i = 0; i < m; ++i)
	{
		int a,b,c;
		cin >> a >> b >> c;
		rin[a][b] = c;
	}
	int DP[(1<<9)][9];
	for (int i = 0; i < (1<<9); ++i)
	{
		for (int j = 0; j < 9; ++j)
		{
			DP[i][j] = 0;
		}
	}
	for (int i = 0; i < n; ++i)
	{
		DP[(1<<i)][0] = rin[0][i];
	}
	for (int i = 1; i < (1<<n); ++i)
	{
		for (int j = 0; j < n; ++j)
		{
			bitset<9> bits = i;
			bits[j] = 0;
			for (int k = 0; k < n; ++k)
			{
				if(bits[k])
				{
					DP[i][j] = max(DP[i][j],DP[bits.to_ulong()][k]);
				}
			}
			for (int k = 0; k < n; ++k)
			{
				if(bits[k])
				{
					DP[i][j] += rin[k][j];
				}
			}
		}
	}
	int ans = 0;
	for (int i = 0; i < n; ++i)
	{
		ans = max(ans,DP[(1<<n)-1][i]);
	}
	cout << ans << endl;
}