#include <iostream>
#include <algorithm>
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)
#define print(x) cout << x << endl;
using namespace std;

template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}

int main(void){
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int N, M;
    cin >> N >> M;
    
    /*next_permutation用の要素配列*/
    int arr[N];
    int A, B, S;
    REP(i, N){
        arr[i] = i;
    }
    
    /*P[item1][item2]=Scoreとして格納*/
    int P[9][9];
    Fill(P, 0);
    REP(i, M){
        cin >> A >> B >> S;
        P[A][B] = S;
    }
    
    int ans = 0;
    int sum;
    do{
        sum = 0;
        FOR(i,0, N){
            FOR(j,i+1,N){
                sum += P[arr[i]][arr[j]];
            }
        }
        ans = max(ans, sum);
    }while(next_permutation(arr, arr + N));
    
    print(ans);
    return 0;
}