#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

int main() {
    
    int N,M;
    cin >> N >> M;
    vector< vector<int> > S( N, vector<int>( N, 0 ) );
    
    vector<int> V(N);
    for ( int i = 0; i < N; i++ ) {
        V[i] = i;
    }
    
    for ( int i = 0; i < M; i++ ) {
        int a,b,s;
        cin >> a >> b >> s;
        
        S[a][b] = s;
    }
    
    int ans = 0;
    
    do {
        
        int s = 0;
        for ( int i = 0; i < N; i++ ) {
        for ( int j = i+1; j < N; j++ ) {
            s += S[V[i]][V[j]];
        }
        }
        ans = max( ans, s );
        
    } while ( next_permutation( V.begin(), V.end() ) );
    
    cout << ans << endl;
    
    return 0;
}