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

int main() {
	int N, M;
	cin >> N >> M;
	vector<array<int, 3>> E(M);
	for(auto &e : E) cin >> e[0] >> e[1] >> e[2];
	
	vector<int> P(N);
	iota(P.begin(), P.end(), 0);
	int ans = 0;
	do {
		int sum = 0;
		for(auto [u, v, c] : E) if(P[u] < P[v]) sum += c;
		ans = max(ans, sum);
	} while(next_permutation(P.begin(), P.end()));
	
	cout << ans << "\n";
}