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

int A[10][10];

int main()
{
    int n, m; cin >> n >> m;
    for (int i = 0; i < m; ++i)
    {
        int a, b, c;
        cin >> a >> b >> c;
        A[a][b] = c;
    }

    vector<int> X(n);
    for (int i=0; i<n; ++i) X[i] = i;

    int ans = 0;
    do {
        int tmp = 0;
        for (int i=0; i<n; ++i) for (int j=i+1; j<n; ++j) tmp += A[X[i]][X[j]];
        ans = max(ans, tmp);
    } while (next_permutation(X.begin(), X.end()));
    
    cout << ans << endl;
}