#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define mod 1000000007
using ll = long long;
using namespace std;
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}


int main(){
  int N,M; cin >> N >> M;
  int a,b,score;
  vector<vector<int>> points(N,vector<int>(N,0));
  rep(i,M){
    cin >> a >> b >> score;
    points[a][b] = score;
  }

  int ans = 0;
  vector<int> vec(N);
  rep(i,N){
    vec[i]=i+1;
  }
  do{
    int preans = 0;
    rep(i,N){
      for(int j=i+1; j<N; j++){
        preans += points[vec[i]-1][vec[j]-1];
      }
    }
    ans = max(ans,preans);
  }while(next_permutation(all(vec)));
  cout << ans << endl;
  return 0;
}