#include <bits/stdc++.h>
using namespace std;
int main(){
  int N, M;
  cin >> N >> M;
  vector<int> A(M), B(M), C(M);
  for (int i = 0; i < M; i++){
    cin >> A[i] >> B[i] >> C[i];
  }
  vector<int> p(N);
  for (int i = 0; i < N; i++){
    p[i] = i;
  }
  int f = 1;
  for (int i = 1; i <= N; i++){
    f *= i;
  }
  int ans = 0;
  for (int i = 0; i < f; i++){
    int sum = 0;
    for (int j = 0; j < M; j++){
      if (p[A[j]] < p[B[j]]){
        sum += C[j];
      }
    }
    ans = max(ans, sum);
    next_permutation(p.begin(), p.end());
  }
  cout << ans << endl;
}