#include"bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,m,n) for(ll i=(ll)m;i<(ll)n;i++)
#define Endl endl
#define pr(i,j) make_pair(i,j) 
const ll mod = 998244353;
const ll inf = 5e18;
const ld pi = 3.14159265358979;
int main() {
	ll n, m;
	cin >> n >> m;
	ll ans = 0;
	vector<ll>ar(n);
	rep(i, 0, n)ar[i] = i;
	vector<ll>a(m), b(m), c(m);
	rep(i, 0, m)cin >> a[i] >> b[i] >> c[i];
	do {
		ll sub = 0;
		rep(i, 0, m) {
			if (ar[a[i]] < ar[b[i]])sub += c[i];
		}
		ans = max(ans, sub);
	} while (next_permutation(ar.begin(), ar.end()));
	cout << ans << endl;
}