#include <bits/stdc++.h>
using namespace std;
#define int long long   // <-----!!!!!!!!!!!!!!!!!!!

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()

typedef long long ll;
typedef pair<int, int> P;

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

    int N, M;
    cin >> N >> M;
    vector<vector<int>> a(N, vector<int>(N, 0));
    rep(i, M) {
        int x, y, z;
        cin >> x >> y >> z;
        a[x][y] = z;
    }

    vector<int> perm(N);
    iota(all(perm), 0);
    int ans = 0;
    do {
        int t = 0;
        rep(i, N) {
            rep2(j, i + 1, N) {
                t += a[perm[i]][perm[j]];
            }
        }
        ans = max(ans, t);
    } while( next_permutation(all(perm)) );

    cout << ans << endl;

}