#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;


int main()
{
	int N, M;
	cin >> N >> M;
	vector<vector<int>>data;
	vector<int>data2;
	data.resize(N);
	data2.resize(N);
	for (size_t i = 0; i < N; i++)
	{
		data[i].resize(N);
		for (size_t j = 0; j < N; j++)
		{
			data[i][j] = 0;
		}
		data2[i] = i;
	}
	int a, b, c;
	for (size_t i = 0; i < M; i++)
	{
		cin >> a >> b >> c;
		data[a][b] = c;
	}
	int ans = 0;
	do
	{
		int max_ = 0;
		for (size_t i = 0; i < N-1; i++)
		{
			for (size_t j = i+1; j < N; j++)
			{
				max_ += data[data2[i]][data2[j]];
			}
		}
		ans = max(ans, max_);
	} while (next_permutation(data2.begin(), data2.end()));
	cout << ans << endl;
	return 0;
}