package no090;

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int m = sc.nextInt();
		int[][] score = new int[n][n];
		for(int i=0;i<m;i++) {
			int item1 = sc.nextInt();
			int item2 = sc.nextInt();
			int s = sc.nextInt();
			score[item1][item2] = s;
		}
		int[] p = new int[n];
		for(int i=0;i<n;i++) {
			p[i] = i;
		}
		int max = 0;
		do {
			int sum = 0;
			for(int i=0;i<n;i++) {
				for(int j=i+1;j<n;j++) {
					sum += score[p[i]][p[j]];
				}
			}
			max = Math.max(max,sum);
		} while (nextPermutation(p));
		System.out.println(max);
	}

	static boolean nextPermutation(int[] p) {
		for(int a=p.length-2;a>=0;--a) {
			if(p[a]<p[a+1]) {
				for(int b=p.length-1;;--b) {
					if(p[b]>p[a]) {
						int t = p[a];
						p[a] = p[b];
						p[b] = t;
						for(++a, b=p.length-1;a<b;++a,--b) {
							t = p[a];
							p[a] = p[b];
							p[b] = t;
						}
						return true;
					}
				}
			}
		}
		return false;
	}

}