#include <bits/stdc++.h>
using namespace std;
#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))

int k[10][10];

int main(){
    int n, m;
    cin >> n >> m;

    REP(i,m){
        int a,b,c;
        cin >> a >> b >> c;
        k[a][b] = c;
    }

    int q[10];
    REP(i,n){
        q[i] = i;
    }

    int maxv = 0;
    do {
        set<int> s;
        int sc = 0;
        REP(i,n){
            int j = q[i];
            s.insert(j);
            REP(l,n){
                if(j == l) continue;
                if(s.count(l)) continue;
                sc += k[j][l];
            }
        }
        maxv = max(maxv, sc);
    } while(next_permutation(q,q+n));

    cout << maxv << endl;
    return 0;
}