#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <ctime>
#include <cstdlib>
 
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define FFOR(i,a,b) for(int i=(a);i<=(b);i++)
#define REP(i,b) FOR(i,0,b)
#define RREP(i,b) FFOR(i,1,b)
#define PB push_back
#define F first
#define S second
#define BE(c) c.begin(),c.end()
using namespace std;
typedef long long LL;
typedef LL ut;
typedef long double ld;
typedef pair<ut,ut> pr;
typedef vector<pr> Vpr;
typedef vector<ut> VI;
typedef pair<ut,pr> ppr;
typedef priority_queue<pr,Vpr, greater<pr> > PQ;
const int SIZE=1e+5 + 1;
const ut INF=1<<29;
const ld eps=1e-6;
const LL mod=1e+6 + 3;

LL memo[32][2048];
int N, M;
int score[32][32], ms[32];

LL rec(int n, int B){
    if(memo[n][B] != -1)
        return memo[n][B];
    if(n >= N)
        return 0;
    LL res = 0;
    REP(i,N){
        if(!(B >> i & 1)){
            int ns = ms[i];
            REP(j,N){
                if(B >> j & 1)
                    ns -= score[i][j];
            }
            res = max(res, rec(n + 1, B | 1 << i) + ns);
        }
    }
    return memo[n][B] = res;
}

int main() {
    memset(memo, -1, sizeof(memo));
    int a, b, s;
    cin >> N >> M;
    REP(i,M){
        cin >> a >> b >> s;
        score[a][b] = s;
        ms[a] += s;
    }
    cout << rec(0, 0) << endl;
 	return 0;
}