package no357;

import java.util.ArrayList;
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 it1 = sc.nextInt();
			int it2 = sc.nextInt();
			score[it1][it2] = sc.nextInt();
		}

		int n1 = n / 2;
		int max = 0;
		for(int i=0;i<1<<n;i++) {
			if (Integer.bitCount(i) != n1) {
				continue;
			}
			int sum = 0;
			for(int j=0;j<n;j++) {
				if ((i >> j & 1) == 1) continue;
				for(int k=0;k<n;k++) {
					if ((i >> k & 1) == 0) continue;
					sum += score[j][k];
				}
			}
			int max1 = max(n,i,0,score);
			int max2 = max(n,i,1,score);
			max = Math.max(max, sum + max1 + max2);
		}
		System.out.println(max);
	}

	static int max(int n,int mask,int use,int[][] score) {
		ArrayList<Integer> al = new ArrayList<>();
		for(int i=0;i<n;i++) {
			if ((mask >> i & 1) == use) {
				al.add(i);
			}
		}
		int n1 = al.size();
		int[] p = new int[n1];
		for(int i=0;i<n1;i++) {
			p[i] = al.get(i);
		}
		int max = 0;
		do {
			int sum = 0;
			for(int i=0;i<n1;i++) {
				for(int j=i+1;j<n1;j++) {
					sum += score[p[i]][p[j]];
				}
			}
			max = Math.max(sum,max);
		} while(nextPermutation(p));
		return 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;
	}
}