#include <bits/stdc++.h>
using namespace std;


int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	int n, m; cin >> n >> m;
	vector<int> items(n);
	vector<int> front(m), back(m), score(m);
	for(int i = 0; i < m; i++) {
		cin >> front[i] >> back[i] >> score[i];
	}
	for(int i = 0; i < n; i++) {
		items[i] = i;
	}
	int ans = 0;
	do{
		int tmp = 0;
		for(int i = 0; i < m; i++) {
			int f = -1, b = -1;
			for(int j = 0; j < n; j++) {
				if(items[j] == front[i]) f = j;
				if(items[j] == back[i])  b = j;
				if(b > f && f > -1 && b > -1) {
					tmp += score[i];
					break;
				}
			}
		}
		ans = max(tmp, ans);
	}while(next_permutation(items.begin(), items.end()));
	cout << ans << endl;
	return 0;                                              
}