#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
#include <queue>
#include <stack>
#include <math.h>
#include <set>
#include <cstdio>
#define ALL(obj) (obj).begin(),(obj).end()
#define RALL(obj) (obj).rbegin(),(obj).rend()
#define P pair<int, int>

#define MOD 1000000007
#define INF 1012345678
#define NINF (-2147483647-1)
#define LLINF 9223372036854775807
using ll = long long;
using namespace std;

int func(int n) {
    if (n <= 1) return 1;
    return n * func(n - 1);
}

int main() {
    int N, M, ans = 0;
    cin >> N >> M;
    vector<vector<int>> score(N, vector<int>(N, 0));
    vector<int> A(N);
    for (int i = 0; i < M; i++)
    {
        int a, b, s;
        cin >> a >> b >> s;
        score[a][b] = s;
    }
    for (int i = 0; i < N; i++)
    {
        A[i] = i;
    }
    int f = func(N);
    int m1 = 0;
    for (int i = 0; i < f; i++)
    {
        int m2 = 0;
        for (int j = 0; j < N-1; j++)
        {
            for (int k = j+1; k < N; k++)
            {
                m2 += score[A[j]][A[k]];
            }
        }
        m1 = max(m1, m2);
        next_permutation(A.begin(),A.end());
    }
    cout << m1 << endl;
    getchar(); getchar();
    return 0;
}