#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main(){
    int n, m; cin >> n >> m;
    vector<int> item1(m), item2(m), score(m);
    for(int i = 0; i < m; i++) cin >> item1[i] >> item2[i] >> score[i];

    int ans = -(1 << 30);
    vector<int> vec(n);
    for(int i = 0; i < n; i++) vec[i] = i;
    do{
        int res = 0;
        vector<int> inds(n);
        for(int i = 0; i < n; i++) inds[vec[i]] = i;
        for(int i = 0; i < m; i++){
            if(inds[item1[i]] < inds[item2[i]]) res += score[i];
        }
        ans = max(ans, res);
    }while(next_permutation(vec.begin(), vec.end()));
    cout << ans << endl;
    return 0;
}