#include <iostream>
#include <algorithm>
#include <cstdio>
#include <string>
#include <numeric>
#include <vector>

#define ll long long

using namespace std;

int M[10001];

int main(){

   int n,m;
   cin>>n>>m;
   int item1[90],item2[90],score[90];
   vector<int> v;
   for(int i=0;i<n;++i) v.push_back(i);
   for(int i=0;i<m;++i) cin>>item1[i]>>item2[i]>>score[i];
   
   int ans=0;
   do{
	    int mini_ans=0;
        for(int j=0;j<m;++j)
            if(v[item1[j]]<v[item2[j]]) mini_ans+=score[j];
        ans=max(ans,mini_ans);
   }while (next_permutation(v.begin(), v.end()));

   cout<<ans<<endl;

   return 0;
}