#include using namespace std; #define rep(i,a,b) for(int i=a;i> N >> M; rep(i, 0, M) { int a, b, c; cin >> a >> b >> c; S[a][b] = c; } rep(ma, 0, 1 << N) { rep(i, 0, N) if (!(ma & (1 << i))) { int mama = ma + (1 << i); int point = 0; rep(j, 0, N) if (ma & (1 << j)) point += S[j][i]; dp[mama] = max(dp[mama], dp[ma] + point); } } cout << dp[(1 << N) - 1] << endl; }