#include<bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M (int)(1e9+7)
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++)
#define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n,0)
#define all(a) a.begin(),a.end()
#define IN(a,n) rep(i,n){ cin>>a[i]; }
const int vx[4] = {0,1,0,-1};
const int vy[4] = {1,0,-1,0};
#define PI 3.14159265
#define F first
#define S second
#define PB push_back
#define EB emplace_back
#define int ll
void init(){
  cin.tie(0);
  ios::sync_with_stdio(false);
}

int n,m;
int d[10][10];
int ans;

void f(vector<int> v,vector<bool> b){
  if(v.size()==n){
    int res=0;
    rep(i,n){
      FOR(j,i+1,n){
        res+=d[v[i]][v[j]];
      }
    }
    ans=max(res,ans);
    return;
  }


  rep(i,n){
    if(b[i]) continue;
    v.PB(i);
    b[i]=true;
    f(v,b);
    b[i]=false;
    v.erase(v.end()-1);
  }
}

main(){
  cin>>n>>m;
  rep(i,m){
    int a,b,c;
    cin>>a>>b>>c;
    d[a][b]=c;
  }

  f(vector<int>(),vector<bool>(n));

  cout<<ans<<endl;
}