#include <iostream>
#include <vector>
#include <unordered_set>

using namespace std;

int max_score=-1;

void proc(int i, int n, vector<int>& buf, unordered_set<int>& selected, vector<vector<int>>& map){
    if(i>=n){
        int score=0;
        for(int j=0; j<n; ++j){
            for(int k=j+1; k<n; ++k){
                score+=map[buf[j]][buf[k]];
            }
        }
        max_score=max(score, max_score);
    } else{
        for(int j=0; j<n; ++j){
            if(selected.find(j)!=selected.end()) continue;
            selected.insert(j);
            buf[i]=j;
            proc(i+1, n, buf, selected, map);
            selected.erase(j);
        }
    }
}

int main(){
    int n, m;
    cin >> n >> m;
    vector<vector<int>> map(n, vector<int>(n, 0));
    for(int i=0; i<m; ++i){
        int i1, i2, s;
        cin >> i1 >> i2 >> s;
        map[i1][i2]=s;
    }
    vector<int> buf(n);
    unordered_set<int> selected;
    proc(0, n, buf, selected, map);
    cout << max_score << endl;
    return 0;
}