#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<sstream>
#include<cctype>
#include<cmath>
#include<algorithm>
using namespace std;

#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define rev(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define repp(i,n) for(int (i)=1;(i)<=(n);(i)++)
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rev(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define clr(a) memset((a), 0 ,sizeof(a))


typedef pair<int,int> P;
typedef vector<pair<int,int> > pii;
typedef map<string,int> mi;

int A[10][10];
int main(){
	int n,m;
	cin >> n >> m;
	vector<int> vc(n);
	rep(i,n)vc[i]=i;
	rep(i,m){
		int a,b,c;
		cin >> a >> b >> c;
		A[a][b]=c;
	}
	int ans=0;
	do{
		int sum=0;
		rep(i,n) for(int j=i+1;j<n;j++)
			sum+=A[vc[i]][vc[j]];
		
		ans=max(ans,sum);
	}while(next_permutation(ALL(vc)));
	
	cout << ans << endl;
	return 0;
}