#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <iomanip>
#include <map>
using namespace std;
typedef long long LL;

const LL MOD=1000000000;

int main(){
    LL N, M;
    cin >> N >> M;
    vector<vector<int> > val(N, vector<int>(N));
    for(int i = 0; i < M; i++){
        int item1, item2, score;
        cin >> item1 >> item2 >> score;
        val[item1][item2] = score;
    }
    vector<int> ord(N);
    for(int i = 0; i < N; i++){
        ord[i] = i;
    }
    int ans = 0;
    do{
        int score = 0;
        for(int i = 0; i < N; i++){
            for(int j = i+1; j < N; j++){
                score += val[ord[i]][ord[j]];
            }
        }
        ans = max(ans, score);
    }while(next_permutation(ord.begin(), ord.end()));

    cout << ans << endl;
    return 0;
}