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

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

const ll mod = 1e9 + 7;
const ll inf = 1e18;

template < typename T >
void vprint(T &V){
	for(auto v : V){
    	cout << v << " ";
	}
	cout << endl;
}

ll T[10][10];

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll N, M;
    cin >> N >> M;

    FOR(i, 0, M){
        ll a, b, c;
        cin >> a >> b >> c;

        T[a][b] = c;
    }

    vector<ll> A;
    FOR(i, 0, N){
        A.push_back(i);
    }

    ll max_score = 0;
    do{
        ll score = 0;
        FOR(i, 0, N){
            FOR(j, i+1, N){
                score += T[A[i]][A[j]];
            }
        }
        chmax(max_score, score);
    }while(next_permutation(ALL(A)));
    
    p(max_score);

    return 0;
}