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

int n, m;
vector<pair<int, int>> item(100); 
vector<int> point(100);

int score(int A[]){
    int res = 0;
    for (int i = 0; i < m; ++i){
        if (A[item[i].first] < A[item[i].second]) res += point[i];
    }
    return res;
}



int main(){
    cin >> n >> m;
    item.resize(m);
    point.resize(m);
    vector<int> id(n);
    for (int i = 0; i < n; ++i){
        id[i] = i;
    }
    for (int j = 0; j < m; ++j){
        cin >> item[j].first >> item[j].second >> point[j];
    }
    int ans = -1;
    do{
        int A[n];
        for (int i = 0; i < n; ++i) A[i] = id[i];
        ans = max(score(A), ans);
    }while (next_permutation(id.begin(), id.end()));
    
    cout << ans << endl;
    
}