#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;

int main() {
    int n, m;
    cin >> n >> m;
    int item1[m], item2[m], score[m];
    for (int i = 0; i < m; i++) {
        cin >> item1[i] >> item2[i] >> score[i];
    }
    int nums[n];
    for (int i = 0; i < n; i++) nums[i] = i;
    int ans = 0;
    do {
        int place[n];
        for (int i = 0; i < n; i++) place[nums[i]] = i;
        int cnt = 0;
        for (int i = 0; i < m; i++) {
            if (place[item1[i]] < place[item2[i]]) cnt += score[i];
        }
        ans = max(ans, cnt);
    } while (next_permutation(nums, nums + n));
    cout << ans << endl;
}