#include<cstdio>
#include<queue>
#include<utility>
#include<cstring>
#include<stack>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<map>
#include<set>
#define MAX_N 100001
#define INF 2147483647
#define REP(i,n) for(int i=0;i<(int)(n);i++)
void init(int n);
int find(int n);
void unite(int x,int y);
bool same(int x, int y);
int dx[4] = {1,0,0,-1};
int dy[4] = {0,1,-1,0};
using namespace std;
typedef long long int ll;
struct edge{
  int from,to,cost;
};
typedef vector<vector<edge> > AdjList;
AdjList graph;
typedef pair<int , int> P;

int main()
{
  int res=0,N,M,score[100][100],i1,i2,s;
  cin >> N >> M;
  REP(i,100)REP(j,100)score[i][j] = 0;
  REP(i,M){
    cin >> i1 >> i2 >> s;
    score[i1][i2] = s;
  }
  vector<int> v(N);
  set<int> d;
  REP(i,N){
    v[i] = i;
    d.insert(i);
  }
  do{
    int tmp=0;
    set<int> dd = d;
    REP(i,N){
      REP(j,N){
        if(dd.count(j)){
          tmp += score[v[i]][j];
        }
      }
      dd.erase(v[i]);
    }
    res = max(res,tmp);
  }while(next_permutation(v.begin(),v.end()));
  cout << res << endl;
  return 0;
}

int par[MAX_N];
int ranks[MAX_N];

//n要素で初期化
void init(int n){
  REP(i,n){
    par[i] = i;
    ranks[i] = 0;
  }

}

//木の根を求める
int find(int x){
  if(par[x] == x){
    return x;
  }else{
    return par[x] = find(par[x]);
  }
}

void unite(int x,int y){
  x = find(x);
  y = find(y);
  if(x == y) return ;
  if(ranks[x] < ranks[y]){
    par[x] = y;
  }else{
    par[y] = x;
    if(ranks[x] == ranks[y]) ranks[x]++;
  }
}

bool same(int x, int y){
  return find(x) == find(y);
}