#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

int N,M,L;

signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin>>N>>M;
    
    int DP[1<<N];
    int TABLE[N][N];
    
    REP(i,1<<N) DP[i] = 0;
    REP(i,N)REP(j,N) TABLE[i][j] = 0;
    
    int a,b,s;
    REP(i, M) {
        cin >> a >> b >> s;
        TABLE[a][b] = s;
    }
    
    REP(i, 1<<N) {
        bitset<14> bs(i);
        if (bs.count() == 1) continue; // no score
        int ma = 0;
        REP(i, N) {
            if (!bs[i]) continue;
            bs.flip(i);
            int score = DP[bs.to_ullong()];
            REP(j, N) {
                if (!bs[j]) continue;
                if (i == j) continue;
                // j -> i のスコアを加算
                score += TABLE[j][i];
            }
            ma = max(ma, score);
            bs.flip(i);
        }
        DP[i] = ma;
    }
    
     cout << DP[(1<<N)-1] << endl;
    
    return 0;
}