#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <cctype>
#include <tuple>
#include <climits>
#include <bitset>
#include <cassert>
#include <random>

#ifdef _MSC_VER
#include <agents.h>
#endif

#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define REV(v) v.rbegin(), v.rend()
#define MEMSET(v, s) memset(v, s, sizeof(v))
#define UNIQUE(v) (v).erase(unique(ALL(v)), (v).end())
#define MP make_pair
#define MT make_tuple

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

const int N = 10;
int G[N][N];

int main(){
	int n, m;
	cin >> n >> m;
	rep(i, m){
		int a, b, c;
		cin >> a >> b >> c;
		G[b][a] = c;
	}

	vector<int> v(n);
	iota(ALL(v), 0);

	int ans = 0;
	do{
		vector<int> vis(n);
		int sc = 0;
		rep(i, n){
			vis[v[i]] = 1;
			rep(j, n) sc += G[v[i]][j] * vis[j];
		}
		ans = max(ans, sc);
	} while (next_permutation(ALL(v)));

	cout << ans << endl;

	return 0;
}