#include <bits/stdc++.h>
#define rep(i,n) for(int i=(0);i<(n);i++)

using namespace std;

typedef long long ll;

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);

	int n, m;
	cin >> n >> m;

	vector<int> i1(m), i2(m);
	vector<ll> sco(m);
	rep(i, m){
		int x, y;
		ll z;
		cin >> x >> y >> z;

		i1[i] = x;
		i2[i] = y;
		sco[i] = z;
	}

	vector<int> v(n);
	rep(i, n) v[i] = i;

	ll ans = 0;
	do{
		ll t = 0;
		map<int, int> mp2;
		rep(i, n) mp2[v[i]] = i;
		rep(i, m){
			if(mp2[i1[i]] < mp2[i2[i]]){
				t += sco[i];
			}
		}
		chmax(ans, t);
	}while(next_permutation(v.begin(), v.end()));

	cout << ans << endl;
}