import std.stdio, std.conv, std.string;
import std.array, std.range, std.algorithm, std.container;
import std.math, std.random, std.bigint, std.datetime, std.format;
string read(){ static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res; }

int DEBUG_LEVEL = 0;
void print()(){ writeln(""); }
void print(T, A ...)(T t, lazy A a){ write(t), print(a); }
void print(int level, T, A ...)(T t, lazy A a){ if(level <= DEBUG_LEVEL) print(t, a); }

void main(string[] args){
	if(args.length > 1 && args[1] == "-debug"){
		if(args.length > 2 && args[2].isNumeric) DEBUG_LEVEL = args[2].to!int;
		else DEBUG_LEVEL = 1;
	}
	
	long n = read.to!long;
	long m = read.to!long;
	
	X[] xs;
	foreach(i; 0 .. m){
		long from = read.to!long;
		long to = read.to!long;
		long value = read.to!long;
		xs ~= new X(from, to, value);
	}
	
	long bestscore = -1;
	long[] as;
	foreach(i; 0 .. n) as ~= i;
	while(1){
		long score;
		foreach(x; xs) if(as[x.from] < as[x.to]) score += x.value;
		if(score > bestscore) bestscore = score;
		
		// next permutation 順列 next_permutation
		long i0 = -1;
		foreach(i; 0 .. as.length - 1) if(as[i] < as[i + 1]) i0 = i;
		if(i0 < 0) break;
		
		long i1 = -1;
		foreach(i; i0 + 1 .. as.length) if(as[i0] < as[i]) i1 = i;
		
		long z;
		z = as[i1], as[i1] = as[i0], as[i0] = z;
		
		foreach(k; 0 .. (as.length - i0 - 1) / 2){
			z = as[i0 + 1 + k], as[i0 + 1 + k] = as[$ - 1 - k], as[$ - 1 - k] = z;
		}
		
		print!1("i0:", i0, " i1:", i1, " as:", as);
		
	}
	
	bestscore.writeln;
	
}

class X{
	long from, to;
	long value;
	this(long from, long to, long value){
		this.from = from, this.to = to;
		this.value = value;
	}
}