#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i = (a); i < (b); ++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n) - 1; (i) >= 0; --i)
#define SZ(n) (int)(n).size()
#define ALL(n) (n).begin(), (n).end()
#define MOD 1000007
#define INF 100000000
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PI;


int main() {
	int n, m;
	cin >> n >> m;
	int sco[100][100] = {};
	REP(i, m) {
		int i1, i2, s;
		cin >> i1 >> i2 >> s;
		sco[i1][i2] = s;
	}
	int a[10] = {};
	REP(i, 10) a[i] = i;
	int ans = 0;
	do {
		int t = 0;
		REP(i, n) {
			REP(j, i) {
				t += sco[a[i]][a[j]];
			}
		}
		ans = max(ans, t);
	} while (next_permutation(a, a + 10));
	cout << ans << endl;
	return 0;
}