// Enjoy your stay.

#include <bits/stdc++.h>

#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define ite iterator
#define mp make_pair
#define mt make_tuple
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define sec second
#define sz(x) ((int)(x).size())

using namespace std;

typedef istringstream iss;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef stringstream sst;
typedef vector<ll> vi;



int main(){
	cin.tie(0);
	ios_base::sync_with_stdio(0);
	
	int N,M;
	int item1[111],item2[111],s[111];
	int perm[10];
	cin>>N>>M;
	rep(i,M)cin>>item1[i]>>item2[i]>>s[i];
	rep(i,N)perm[i] = i;
	int ans = 0;
	do{
		int res = 0;
		rep(i,M){
			if(perm[item1[i]] < perm[item2[i]]) res += s[i];
		}
		ans = max(ans,res);
	}while(next_permutation(perm,perm+N));
	cout<<ans<<endl;
}