#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>

using namespace std;

#define int long long
#define rep(i,n) for(int i = 0; i < (n); i++)
#define endl "\n"

const long long INF = (long long)1e18;
const long long MOD = (long long)1e9 + 7; 

string yn(bool f){return f?"Yes":"No";}
string YN(bool f){return f?"YES":"NO";}

#define MAX 20
int N, M;
int a, b, c;
static int cost[MAX][MAX];
static int dp[MAX][MAX][(1<<17)];

int solve(int x = -1, int z = 0, int y = 0, int sum = 0){
	if(x == -1){
		int ma = 0;
		for(int i = 0; i < N; i++){
			ma = max(ma, solve(i,i, y | (1<<i), sum));
		}
		
		return ma;
	}
	// cout<<x<<" "<<z<<" "<<y<<endl;
	if(dp[x][z][y]) return dp[x][z][y]-1;
	
	int ma = sum;
	for(int i = 0; i < N; i++){
		if(!cost[x][i]) continue;
		if(y&(1<<i)) continue;
		ma = max(ma, solve(i, z, y|(1<<i), sum + cost[x][i]));
	}
	
	dp[x][z][y] = ma+1;
	
	return ma;
}

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout<<fixed<<setprecision(10);
	
	
	cin>>N>>M;
	
	for(int i = 0; i < M; i++){
		cin>>a>>b>>c;
		a--, b--;
		cost[a][b] = c;
		cost[b][a] = c;
	}
	
	cout<<solve()<<endl;
	return 0;
}