#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;

template<class T> void vin(vector<T>& v, int n) {
    v.resize(n);
    for (int i = 0; i < n; ++i) {
        cin >> v[i];
    }
}

int N, M;

int dp[1<<15];

int item[200][200];

int solve(int S) {
    int& res = dp[S];
    if (res >= 0) return res;
    if (S == (1 << N) - 1) {
        return (res = 0);
    }
    for (int u = 0; u < N; ++u) {
        if (!(S >> u & 1)) {
            int score = 0;
            for (int k = 0; k < N; ++k) {
                if (S >> k & 1) {
                    if (item[k][u] == -1) continue;
                    score += item[k][u];
                }
            }
            res = max(res, solve(S | 1 << u) + score);
        }
    }
    return res;
}

int main() {
    cin >> N >> M;
    fill(item[0], item[200], -1);
    rep(i, M) {
        int t1, t2, sc;
        cin >> t1 >> t2 >> sc;
        item[t1][t2] = sc;
    }
    fill(dp, dp+(1<<15), -1);
    cout << solve(0) << endl;
    return 0;
}