#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    ll n, m;
    cin >> n >> m;
    vector<ll> item1(m), item2(m), score(m);
    rep(i, m) {
        cin >> item1[i] >> item2[i] >> score[i];
    }
    vector<ll> v(n);
    rep(i, n) v[i] = i;
    ll ans = 0;
    do {
        vector<ll> idx(n);
        rep(i, n) idx[v[i]] = i;
        ll tmp = 0;
        rep(i, m) {
            if (idx[item1[i]] < idx[item2[i]]) {
                tmp += score[i];
            }
        }
        ans = max(ans, tmp);
    }
    while(next_permutation(all(v)));
    cout << ans << endl;
    return 0;
}