#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<memory>
#include<functional>
#include<set>
 
using namespace std;
 
#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
#define PP(p) cout<<(p)<<" ";
#define pb push_back
#define mp make_pair
#define INF 1e18

typedef long long ll;
#define int ll
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef vector<char> vc;
typedef pair<int, int> pi;
//int dy[8]={1,1,1,0,-1,-1,-1,0};
//int dx[8]={-1,0,1,1,1,0,-1,-1};
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};

int N,M;
vi dp;
vvi d;
void input(){
	cin>>N>>M;
	dp.resize(1<<N,-1);
	d.resize(N+1,vi(N+1,0));
	rep(i,M){
		int a,b,c;
		cin>>a>>b>>c;
		d[a][b]=c;
	}
}
int d2b(int n){
	vi b(32,0);
	int i;
	for(i=0;n>0;i++){
		b[i]=n%2;
		n/=2;
	}
	while(i>0)PP(b[--i]);
	return 0;
}
int dfs(int S,int now){
	if(S>=(1<<N)-1)return 0;
	if(dp[S]!=-1)return dp[S];
	int ret=0;
	rep(i,N){
		if((S>>i)&1)continue;
		ret=max(ret,dfs(S|1<<i,i)+d[i][now]);
	}
	return dp[S]=ret;
}
signed main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	input();
	vi t;
	int ans=0;
	rep(i,N){
		ans=max(ans,dfs(0|1<<i,i));
	}
	P(ans)
	return 0;
}