#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>

typedef long long int ll;
//#include<bits/stdc++.h>


using namespace std;

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}







int main()
{

    int Q;
    Q = 1;
    //cin >> Q;   

    while (Q--) {
        
        int n, m;
        cin >> n >> m;
        vector<int>a(n);
        for (int i = 0; i < n; i++)a[i] = i;
        vector<vector<int>>r(n + 3, vector<int>(n + 3));
        for (int i = 0; i < m; i++) {
            int x, y, c;
            cin >> x >> y >> c;
            r[x][y] = c;
        }
        ll ans = 0;
        do{
            ll t = 0;
            for (int i = 0; i < n - 1; i++) {
                t += r[a[i]][a[i + 1]];
            }
            ans = max(ans, t);
        } while (next_permutation(a.begin(), a.end()));
        cout << ans;
    }
        return 0;
}