#pragma region Macros

#include <bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;
// using namespace __gnu_cxx;

#define TO_STRING(var) # var
#define pb emplace_back
#define int ll
#define endl '\n'

using ll = long long;
using ld = long double;
const ld PI = acos(-1);
const ld EPS = 1e-10;
const int INF = 1 << 30;
const ll INFL = 1LL << 62;
// const int MOD = 998244353;
const int MOD = 1000000007;

int ceil(int x, int y) {return (x > 0 ? (x + y - 1) / y : x / y);}
int POW(int x, int y) {
    if (y != (int)(y) or y < 0 or x != 0 && x != 1 && y > 64) {cout << "Error" << endl;return 0;}
    if (y == 0) return 1;
    if (y % 2 == 0) return POW(x * x, y / 2);
    return x * POW(x, y - 1);
}

__attribute__((constructor))
void constructor() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);
}

#pragma endregion

signed main() {
    int N, M;
	cin >> N >> M;

	vector<int> X(M);
    vector<int> Y(M);
    vector<int> C(M);
    for (int i = 0; i < M; i++) cin >> X[i] >> Y[i] >> C[i];

    vector<int> B(N);
    for (int i = 0; i < N; i++) B[i] = i;

    int ans = 0;
    do {
		unordered_map<int,int> mp;
		for (int i = 0; i < N; i++) mp[B[i]] = i;
        int sum = 0;
        for (int i = 0; i < M; i++) {
            if (mp[X[i]] < mp[Y[i]]) sum += C[i];
        }
        ans = max(ans, sum);
    } while (next_permutation(B.begin(), B.end()));

	cout << ans << endl;
	
}