#include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <set>
#include <vector>
#include <map>
#include <list>
#include <stack>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <queue>
#define mkp(a, b) make_pair(a, b)
#define pb(t) push_back(t)
#define ft first
#define sc second
#define pt(num) cout << num << "\n"
#define moC(a, s, b) (a)=((a)s(b)+MOD)%MOD
#define max(a, b) ((a)>(b) ? (a):(b))
#define min(a, b) ((a)<(b) ? (a):(b))
#define chmax(a, b) (a<b ? a=b : 0)
#define chmin(a, b) (a>b ? a=b : 0)
#define INF 1000000000000000000
#define MOD 1000000007LL
#define MAX 101010
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef map<ll, ll> Map;



int main(void) {
    ll N, M;
    cin >> N >> M;
    ll i, j, k;
    ll g[11][11]={};
    vector<ll> v;
    ll fa[11]={};
    fa[0]=1;
    for(i=1; i<=N; i++) fa[i]=fa[i-1]*i;
    
    for(i=0; i<N; i++) v.pb(i);
    
    for(i=0; i<M; i++) {
        ll a, b, c;
        cin >> a >> b >> c;
        g[a][b]=c;
    }
    
    ll ans=0;
    for(k=0; k<fa[N]; k++) {
        ll t=0;
        for(i=0; i<v.size(); i++) {
            for(j=i+1; j<v.size(); j++) {
                t+=g[v[i]][v[j]];
            }
        }
        chmax(ans, t);
        next_permutation(v.begin(), v.end());
    }
    pt(ans);
}