// {{{ Templates
#include <bits/stdc++.h>

#define show(x) cerr << #x << " = " << x << endl

using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v)
{
    os << "sz:" << v.size() << "\n[";
    for (const auto& p : v) {
        os << p << ",";
    }
    os << "]\n";
    return os;
}

template <typename S, typename T>
ostream& operator<<(ostream& os, const pair<S, T>& p)
{
    os << "(" << p.first << "," << p.second
       << ")";
    return os;
}


constexpr ll MOD = (ll)1e9 + 7LL;

template <typename T>
constexpr T INF = numeric_limits<T>::max() / 100;

// }}}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N, M;
    cin >> N >> M;
    vector<int> front(M);
    vector<int> back(M);
    vector<int> score(M);
    for (int i = 0; i < M; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        front[i] = a;
        back[i] = b;
        score[i] = c;
    }
    vector<int> index(N);
    ll patterns = 1;
    for (int i = 0; i < N; i++) {
        index[i] = i;
        patterns *= (i + 1);
    }

    int maxi = -INF<int>;
    for (ll i = 0; i < patterns; i++) {
        int s = 0;
        for (ll j = 0; j < M; j++) {
            if (index[front[j]] < index[back[j]]) {
                s += score[j];
            }
        }
        maxi = max(maxi, s);
        next_permutation(index.begin(), index.end());
    }
    cout << maxi << endl;

    return 0;
}