#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

const ll MAX_N = 20;

ll dp[1<<MAX_N];

ll pre[20][20];

void chmax(ll &a, ll b){ if( a < b){ swap(a,b);} return ;}

int main(){ 
  ll N,M; cin >> N >> M;
  
  for(ll i = 0; i < 1<<MAX_N; i++){ dp[i] = 0;}
  
  for(ll i = 0; i < 20; i++){
    for(ll j = 0; j < 20; j++){ 
      pre[i][j] = 0;}}
  
  for(ll i = 0; i < M; i++){
    ll a,b,score; cin >> a >> b >> score; 
    pre[a][b] = score;}
 
  for(ll k = 0; k < 1<<N; k++){
    for(ll i = 0; i < N; i++){ 
      if(!((k>>i)&1)){ //まだi番目の品物を並べていない
        ll res = 0;
        for(ll j = 0; j < N; j++){ 
          if( i != j && ((k >> j) & 1)){
            res += pre[i][j];
        }
      }
       chmax(dp[k+(1<<i)],dp[k]+res);
    }
   }
  }
  
  cout << dp[(1<<N)-1] << endl; return 0;}