//No.90 品物の並び替え

import java.util.*;
import java.io.*;
import static java.util.Arrays.*;
import static java.lang.Math.*;

public class No90 {
    
    static final Scanner in = new Scanner(System.in);
    static final PrintWriter out = new PrintWriter(System.out,false);

    static void solve() {
        int n = in.nextInt();
        int m = in.nextInt();
        int[] a = new int[n];
        for (int i=0; i<n; i++) a[i] = i;

        int[][] s = new int[m][3];
        for (int i=0; i<m; i++) {
            s[i][0] = in.nextInt();
            s[i][1] = in.nextInt();
            s[i][2] = in.nextInt();
        }

        int max = 0;
        do {
            int score = 0;
            for (int k=0; k<m; k++) {
                for (int i=0; i<n; i++) {
                    if (a[i] == s[k][0]) score += s[k][2];
                    if (a[i] == s[k][1]) break;
                }
            }
            max = max(max,score);
        }while(nextPermutation(a));

        out.println(max);
    }

    static boolean nextPermutation(int[] a) {
        int n = a.length, i, j;
        for (i=n-2; i>=0 && a[i]>=a[i+1]; i--);
        if (i == -1) return false;
        for (j=i+1; j<n && a[i]<a[j]; j++);
        int temp = a[i]; a[i] = a[j-1]; a[j-1] = temp;
        for (int l=i+1, r=n-1; l<r; l++,r--) {
            temp = a[l]; a[l] = a[r]; a[r] = temp;
        }
        return true;
    }

    public static void main(String[] args) {
        long start = System.currentTimeMillis();

        solve();
        out.flush();

        long end = System.currentTimeMillis();
        //trace(end-start + "ms");
        in.close();
        out.close();
    }

    static void trace(Object... o) { System.out.println(deepToString(o));}
}