#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

int i1[100], i2[100], score[100];
int perm[10];

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    int N, M;
    std::cin >> N >> M;

    for(int i=0;i<M;++i){
        std::cin >> i1[i] >> i2[i] >> score[i];
    }

    iota(perm, perm + N, 0);

    ll maxScore = 0ll;
    while(next_permutation(perm, perm + N)){
        ll s = 0ll;
        for(int i=0;i<M;++i){
            if(perm[i1[i]] < perm[i2[i]]){
                s += score[i];
            }
        }

        maxScore = max(maxScore, s);
    }

    std::cout << maxScore << std::endl;
}