#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "math.h"
#include "utility"
#include "string"
#include "map"
#include "unordered_map"
#include "iomanip"
#include "random"

using namespace std;
const long long int MOD = 1000000007;
list<long long int> Prime(int M) {
	list<long long int>P;
	P.push_back(2);
	P.push_back(3);
	for (int i = 5; i <= M; i += 6) {
		bool flag = true;
		for (auto j : P) {
			if (i%j == 0) {
				flag = false;
				break;
			}
		}
		if (flag)P.push_back(i);
		flag = true;
		for (auto j : P) {
			if ((i + 2) % j == 0) {
				flag = false;
				break;
			}
		}
		if (flag)P.push_back(i + 2);
	}
	return P;
}

long long int N, K, Q, M;
long long int ans;

int box[9][9];

void Search(int depth, vector<int>num, vector<bool>flag) {
	if (depth == N) {
		long long int bag = 0;
		for (int i = 0; i < N; i++) {
			for (int j = i + 1; j < N; j++) {
				bag += box[num[i]][num[j]];
			}
		}
		ans = max(bag, ans);
		return;
	}
	for (int i = 0; i < N; i++) {
		if (!flag[i]) {
			num.push_back(i);
			flag[i] = true;
			Search(depth + 1, num, flag);
			num.pop_back();
			flag[i] = false;
		}
	}
	return;
}

int main() {
	ios::sync_with_stdio(false);
	cin >> N >> M;
	for (int i = 0; i < M; i++) {
		int a, b, c;
		cin >> a >> b >> c;
		box[a][b] = c;
	}
	Search(0, vector<int>(0), vector<bool>(N, false));
	cout << ans << endl;
	return 0;
}