#include <iostream>
#include <algorithm>
#include <vector>
#include <stdio.h>
#include <cmath>

using namespace std;
typedef uint uint32_t;

int N, M;
int scores[9][9] = {};
int items[9] = {0,1,2,3,4,5,6,7,8};

void print_i() {
    for (int i = 0; i < N; i++) {
        cout << items[i] << ' ';
    }
    cout << endl;
}

int main() {
    cin >> N >> M;
    int i,j,s;
    for (int k = 0; k < M; k++) {
        cin >> i >> j >> s;
        scores[i][j] = s;
    }

    int m = 0;
    do {
        s = 0;
        // print_i();
        for (int i = 0; i < N; i++) {
            for (int j = i + 1; j < N; j++) {
                s += scores[items[i]][items[j]];
            }
        }
        if (m < s) m = s;
    } while (next_permutation(items, items + N));

    
    cout << m << endl;
}