#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,m,n) for(int i=m; i<int(n); ++i)
#define repll(i,m,n) for(ll i=m; i<ll(n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define fi first
#define se second

template<typename T> bool chmin(T& a, T b){ if(a > b){a = b; return true;} return false; }
template<typename T> bool chmax(T& a, T b){ if(a < b){a = b; return true;} return false; }

template<typename T> T gcd(T a, T b){ return a % b ? gcd(b, a % b) : b; }
template<typename T> T lcm(T a, T b){ return a / gcd(a, b) * b; }

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

    int N, M;
    cin >> N >> M;

    vector<array<int, 3>> table(M);
    rep(i, 0, M) rep(j, 0, 3) cin >> table[i][j];

    vector<int> posi(N);
    rep(i, 0, N) posi[i] = i;

    int ans = -1;
    do{
        int score = 0;
        rep(i, 0, M){
            if(posi[table[i][0]] < posi[table[i][1]]) score += table[i][2];
        }
        chmax(ans, score);
    }while(next_permutation(all(posi)));
    
    cout << ans << endl;
    return 0;
}