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

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 ma = 0;
	int now[9];
	for (int i = 0; i < 9; ++i)
	{
		now[i] = i;
	}
	do
	{
		int ima = 0;
		for (int i = 0; i < n-1; ++i)
		{
			if(rin[now[i]][now[i+1]] != 0)
			{
				ima += rin[now[i]][now[i+1]];
			}
		}
		ma = max(ma,ima);
	} while (next_permutation(now,now+n));
	cout << ma << endl;
}