#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<string>
#include<iostream>
#include<cctype>
#include<cstdio>
#include<vector>
#include<stack>
#include<queue>
#include <algorithm>
#include<math.h>
#include<set>
#include<map>
#include<iomanip>

//#include<bits/stdc++.h>


using namespace std;



int main() {
	
	int n, m;
	cin >> n >> m;
	vector<int>p(n);
	for (int i = 0; i < n; i++)
		p[i] = i;
	vector<vector<int>>Q(n, vector<int>(n));
	for (int i = 0; i < m; i++) {
		int a, b, c;
		cin >> a >> b >> c;
		Q[a][b] = c;
	}
	int ans = 0;
	do{
		int t = 0;
		for (int i = 0; i < n; i++)
			for (int j = i + 1; j < n; j++)t += Q[p[i]][p[j]];
		ans = max(ans, t);
	} while (next_permutation(begin(p), end(p)));

	cout << ans << endl;

	return 0;

}