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

int main() {
	int n, m;
	cin >> n >> m;
	vector<vector<int>> table(n, vector<int>(n, 0));
	rep(i, m) {
		int item1, item2, score;
		cin >> item1 >> item2 >> score;
		table[item1][item2] = score;
	}

	vector<int> v(n);
	rep(i, n) v[i] = i;

	int max_score = 0;
	do {
		int score = 0;
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < i; j++) {
				score += table[v[j]][v[i]];
			}
		}
		max_score = max(max_score, score);
	} while (next_permutation(v.begin(), v.end()));

	cout << max_score << "\n";

	return 0;
}