#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
#include<complex>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>
#include<stack>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;

vector<pii> G[20];
int dp[1<<15];

int dfs(int state, int n) {
    int& ret = dp[state];
    if (ret >= 0) return ret;
    int m = __builtin_popcount(state);
    if (m==n) return ret = 0;
    ret = 0;
    for (int i = 0; i < n; i++) {
        if ((state>>i)&1) continue;
        int plus = 0;
        for (pii el : G[i]) {
            if ((state>>el.first)&1) plus += el.second;
        }
        ret = max(ret, plus + dfs(state|1<<i, n));
    }
    return ret;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, M;
    cin >> N >> M;
    for (int i = 0; i < M; i++) {
        int i1, i2, s;
        cin >> i1 >> i2 >> s;
        G[i1].emplace_back(i2, s);
    }
    memset(dp, -1, sizeof(dp));
    cout << dfs(0, N) << endl;
    return 0;
}