#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define itrep(i,x) for(auto i=(x).begin(); i!=(x).end();i++)
#define Sort(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define vi vector<int>
#define INF (int)1e9
#define INFL 1e18
#define MOD 1000000007
#define pb push_back
#define MP make_pair
#define PI 3.1415926535
typedef long long int ll;
typedef std::pair<int,int> P;
int D=1;
int dx[4]={0,1,0,-1},dy[4]={-1,0,1,0};

using namespace std;


int main(){
    int n,m;
    cin>>n>>m;
    vector<int> v(n);
    rep(i,0,n)v[i]=i;
    vector<vector<int>> g(n,vector<int>(n));
    rep(i,0,m){
        int a,b,c;
        cin>>a>>b>>c;
        g[a][b]=c;
    }
    ll ans=0;
    do{
        ll sum=0;
        rep(i,0,n-1){
            rep(j,i+1,n){
                sum+=g[v[i]][v[j]];
            }
        }
        ans=max(ans,sum);
    }while(next_permutation(all(v)));
    
    cout<<ans<<endl;
    return 0;
}