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

int n, m;
int data[11][11];
int memo[11][1<<11][11];

int solve(int p, int bit, int pre){

  if(!p) return 0;
  if(~memo[p][bit][pre]) return memo[p][bit][pre];
  
  int ret = 0;
  for(int i=0;i<n;i++)
    if(!(bit & (1 << i)))
      ret = max(ret, solve(p-1, (bit | (1 << i)), i)+data[pre][i]);

  return memo[p][bit][pre] = ret;

}

int main(){

  int a, b, c;
  cin >> n >> m;
  for(int i=0;i<m;i++){
    cin >> a >> b >> c;
    data[a][b] = c;
  }

  memset(memo, -1, sizeof(memo));
  int ans = 0;
  for(int i=0;i<n;i++) ans = max(ans, solve(n, (1 << i), i));

  cout << ans << endl;

}