/* -*- coding: utf-8 -*-
 *
 * 90.cc: No.90 品物の並び替え - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 9;
const int MAX_M = MAX_N * (MAX_N - 1);

/* typedef */

/* global variables */

int is[MAX_M], js[MAX_M], cs[MAX_M];
int ps[MAX_N];

/* subroutines */

/* main */

int main() {
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < m; i++) cin >> is[i] >> js[i] >> cs[i];

  for (int i = 0; i < n; i++) ps[i] = i;

  int maxsum = 0;
  
  do {
    int sum = 0;
    for (int i = 0; i < m; i++)
      if (ps[is[i]] < ps[js[i]]) sum += cs[i];
    if (maxsum < sum) maxsum = sum;
  } while (next_permutation(ps, ps + n));

  printf("%d\n", maxsum);
  return 0;
}