#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cstring>

typedef long long ll;
using namespace std;

#define mod 1000000009
#define INF 10000000
#define LLINF 2000000000000000000LL

#define SIZE 101


int main(){
    int n,m,a,b,c,ans=0;
    int item1[SIZE],item2[SIZE],score[SIZE];
    int per[9]={0,1,2,3,4,5,6,7,8};
    
    scanf("%d%d",&n,&m);
    
    for(int i=0;i<m;i++){
        scanf("%d%d%d",&item1[i],&item2[i],&score[i]);
    }
    
    do{
        int dic[9]={0},S=0;
        
        for(int i=0;i<n;i++)
            dic[per[i]]=i;
        
        for(int i=0;i<m;i++){
            if(dic[item1[i]] < dic[item2[i]])
                S+=score[i];
        }
        
        ans=max(ans,S);
        
    }while(next_permutation(per,per+n));
    
    printf("%d",ans);
    
    return 0;
}