#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<numeric>
#include<functional>
#include<complex>

using namespace std;
#define BET(a,b,c) ((a)<=(b)&&(b)<(c))
#define FOR(i,n) for(int i=0,i##_end=(int(n));i<i##_end;i++)
#define SZ(x) (int)(x.size())
#define ALL(x) (x).begin(),(x).end()
#define MP make_pair
#define FOR_EACH(it,v) for(__typeof(v.begin()) it=v.begin(),it_end=v.end() ; it != it_end ; it++)
typedef vector<int> VI;
typedef vector<VI> VVI;

int main()
{
    int N,M;
    cin>>N>>M;
    VI p1(M),p2(M),score(M);
    FOR(i,M) cin>>p1[i]>>p2[i]>>score[i];
    VI perm(N);
    FOR(i,N) perm[i] = i;
    int ans = -1<<29;
    do{
        int sum = 0 ;
        FOR(i,M){
            if(perm[p1[i]] < perm[p2[i]]) sum += score[i];
        }
        ans = max(ans, sum);
    }while(next_permutation(ALL(perm)));
    cout<<ans<<endl;
    return 0;
}