#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, string> pls;


int main()
{
	int N, M;
	cin >> N >> M;
	vector<pair<pair<ll, ll>, ll>> v(M);
	vector<ll> a(N);

	for (int i = 0; i < M; i++) {
		cin >> v[i].first.first >> v[i].first.second >> v[i].second;
	}

	for (int i = 0; i < N; i++)
		a[i] = i;

	ll ans = 0;
	do {
		int permutation[10], j = 0;
		for (auto i : a) {
			permutation[i] = j++;
		}
	
		ll sum = 0;
		for (int i = 0; i < M; i++) {
				if (permutation[v[i].first.first] > permutation[v[i].first.second]) {
				sum += v[i].second;
			}
		}
		ans = max(ans,sum);
	} while (next_permutation(a.begin(), a.end()));

	cout << ans << endl;
	return 0;
}