#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int main() {
	int N, M;
	cin >> N >> M;
	vector<int> item1(M), item2(M), score(M);
	for (int i = 0; i < M; ++i) cin >> item1[i] >> item2[i] >> score[i];
	vector<int> tmp1(N);
	for (int i = 0; i < N; ++i) tmp1[i] = i;
	int ans = 0;
	do {
		int sum = 0;
		for (int j = 0; j < M; ++j) {
			int tmp2, tmp3;
			for (int k = 0; k < N; ++k) {
				if (tmp1[k] == item1[j]) tmp2 = k;
				else if (tmp1[k] == item2[j]) tmp3 = k;
			}
			if (tmp2 < tmp3) sum += score[j];
		}
		ans = max(sum, ans);
	} while (next_permutation(tmp1.begin(), tmp1.end()));
	cout << ans;
}