#include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cstring>
using namespace std;

typedef long long LL;
typedef vector<int> VI;

#define REP(i,n) for(int i=0; i<int(n); i++)
#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)

template<class T> inline T &amin(T &a, T b) { if (a>b) a=b; return a; }
template<class T> inline T &amax(T &a, T b) { if (a<b) a=b; return a; }

int N, M, F[9][9];
int I[9];

int main() {
    scanf("%d%d", &N, &M);
    REP (i, M) {
	int x, y, s;
	scanf("%d%d%d", &x, &y, &s);
	F[x][y] = s;
    }
    REP (i, N) I[i] = i;

    int ans = 0;
    do {
	int sum = 0;
	REP (i, N) {
	    REP (j, N) {
		if (I[i] < I[j]) sum += F[i][j];
	    }
	}
	amax(ans, sum);
    } while (next_permutation(I, I+N));

    printf("%d\n", ans);
    return 0;
}