#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<list>
#include<queue>
#include<math.h>
#include<bitset>
using ll = long long;
using namespace std;

int main(){
    ll n, m, ans = 0, arr[9], list[90][90];
    cin >> n >> m;
    for (int i = 0; i < n; i++) arr[i] = i;
    for (int i = 0; i < m; i++) {
        int t1, t2, t3;
        cin >> t1 >> t2 >> t3;
        list[t1][t2] = t3;
    }
    do {
        ll tmp = 0;
        for (int i = 0; i < n; i++){
            for (int j = i+1; j < n; j++){
                tmp += list[arr[i]][arr[j]];
            }
        }
        ans = max(ans, tmp);
    }while (next_permutation(arr, arr+n));
    cout << ans << endl;
}