#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    int n, m, item1, item2, sc;
    
    cin >> n >> m;
    vector<vector<int>> score(n,vector<int>(n, 0));

    while(m>0) {
        cin >> item1 >> item2 >> sc ;
        score[item1][item2] = sc;
        m--;
    }

    vector<int> item_order(n,0);
    
    for(int i=0;i<=n-1;i++) {
        item_order[i] = i;
    }

    int sum1 = 0;
    do {
        int sum2 = 0;
        for(auto itr1=item_order.begin();itr1!=item_order.end()-1;itr1++) {
            for(auto itr2=itr1+1;itr2!=item_order.end();itr2++) {
                if (score[*itr1][*itr2]) sum2 += score[*itr1][*itr2];
                continue;
            }
        }
        sum1 = max(sum1,sum2);

    } while (next_permutation(item_order.begin(),item_order.end()));

    cout << sum1 << endl;

    return 0;
}