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

#define int long long

typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
template<class T,class U>void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>void chmax(T &t,U f){if(t<f)t=f;}

int n,m;
int a[100],b[100],c[100];

signed main(){
    cin>>n>>m;
    rep(i,m){
        cin>>a[i]>>b[i]>>c[i];
        a[i]--;b[i]--;
    }

    vint p(n);rep(i,n)p[i]=i;

    int ma=0;
    do{
        int sum=0;
        rep(i,m){
            if(p[a[i]]<p[b[i]])sum+=c[i];
        }
        ma=max(ma,sum);
    }while(next_permutation(all(p)));

    cout<<ma<<endl;

    return 0;
}