#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <stack>
#include <utility>
#include <queue>
//#include <random>
#include <time.h>
#include <memory.h>

#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)

#define SWAP(a,b) (a ^= b,b = a ^ b,a ^= b)
#define swap(type,a,b) do{type _c;_c=a;a=b;b=_c;}while(0)

using namespace std;
typedef long long int lint;

template <typename _Ty>
ostream& operator << (ostream& ostr, const vector<_Ty>& v) {
	if (v.empty()) {
		cout << "{ }";
		return ostr;
	}
	cout << "{" << v.front();
	for (auto itr = ++v.begin(); itr != v.end(); itr++) {
		cout << ", " << *itr;
	}
	cout << "}";
	return ostr;
}

void print(int* data, int l, int r)
{
	for (int i = l; i < r; i++) {
		cout << data[i] << " ";
	}
	cout << endl;
}

int yuki0090()
{
	int N, M, item1[72], item2[72], score[72], perm[10];
	
	cin >> N >> M;
	for (int i = 0; i < M; i++) {
		cin >> item1[i] >> item2[i] >> score[i];
	}

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

	bool relation[10][10];

	int ans = 0;
	do {
		int sum = 0;
		memset(relation, false, sizeof(relation));

		for (int i = 0; i < N - 1; i++) {
			for (int j = i + 1; j < N; j++) {
				relation[perm[i]][perm[j]] = true;
			}
		}

		for (int i = 0; i < M; i++) {
			if (relation[item1[i]][item2[i]]) {
				sum += score[i];
			}
		}
		if (ans < sum)
			ans = sum;
	} while (next_permutation(perm, perm + N));

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


int main()
{
	//clock_t start, end;
	//start = clock();

	yuki0090();

	//end = clock();
	//printf("%d msec.\n", end - start);

	return 0;
}