#include <iostream>
#include <cmath>
#include <climits>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#include <utility>

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

using namespace std;

typedef pair<int,int> P;
typedef pair<P,int> PP;
typedef long long int LL;

const int MAX_N=9;
const int MAX_M=MAX_N*(MAX_N-1);
int scores[9][9];
int sina[9];

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	REP(i,9)	fill(scores[i],scores[i]+9,0);
	int N,M;
	cin>>N>>M;
	int ans=-1;
	REP(i,M){
		int item1,item2,score;
		cin>>item1>>item2>>score;
		scores[item2][item1]=score;
	}
	vector<int> v(N);
	REP(i,N)	v[i]=i;
	do{
		int x=0;
		REP(i,N){
			REP(j,i){
				x+=scores[v[i]][v[j]];
			}
		}
		ans=max(ans,x);
	}while(next_permutation(ALL(v)));
	cout<<ans<<endl;
	return 0;
}