#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

int n, m;
int item1[72], item2[72], score[72];

int main() {
	cin >> n >> m;
	REP(i, m) {
		scanf("%d %d %d", item1 + i, item2 + i, score + i);
		item1[i]--; item2[i]--;
	}
	
	int ans = 0;
	int o[9] = {0,1,2,3,4,5,6,7,8};
	
	do {
		
		int pos[8];
		REP(i, 8) pos[o[i]] = i;
		
		int now = 0;
		REP(i, m) if (pos[item1[i]] < pos[item2[i]]) now += score[i];
		chmax(ans, now);
		
	} while (next_permutation(o, o + n));
	
	cout << ans << endl;
	
	return 0;
}