//No.90 品物の並び替え
//No.98 品物の並び替え (Extra)

import std.stdio;

int[50][50] mat;
int N, M;

void main() {
	readf("%d %d\n", &N, &M);
	for(int i=0; i<M; i++) {
		int item1, item2, score;
		readf("%d %d %d\n", &item1, &item2, &score);
		mat[item1][item2] = score;
	}

	bool[] items;
	items.length = N;
	writeln(getScore(items));
}

ulong getScore(bool[] used) {
	ulong max = 0;
	for(int i=0; i<N; i++) {
		if(!used[i]) {
			bool[] tmp = used.dup;
			tmp[i] = true;
			ulong localMax = getScore(tmp) + addScore(used, i);
			if(localMax > max)
				max = localMax;
		}
	}
	return max;
}

ulong addScore(bool[] used, int item) {
	ulong total = 0;
	for(int i=0; i<N; i++) {
		if(used[i])
			total += mat[i][item];
	}
	return total;
}