#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)

int main(void){
	int n, m; cin >> n >> m;
	vector<pair<int, int> > sinamono(m);
	vector<int> score(m);
	rep(i, m) cin >> sinamono[i].first >> sinamono[i].second >> score[i];

	vector<int> v;
	rep(i, n) v.push_back(i);

	int ans = 0;
	do{
		int tmp = 0;
		rep(i, m){
			auto itr1 = find(v.begin(), v.end(), sinamono[i].first);
			auto itr2 = find(v.begin(), v.end(), sinamono[i].second);
			if(itr2 - v.begin() > itr1 - v.begin()) tmp += score[i];
		}
		ans = max(ans, tmp);
	}while(next_permutation(v.begin(), v.end()));
	printf("%d\n", ans);
	return 0;
}