#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <set>
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
/* ここからが本編 */
/*  */
int kaizyou(int n)
{
  int rep = n;
  while(--n) rep *= n;
  return rep;
}
int e_cnt(int e[],int n)
{
  int i;
  int cnt = 0;
  for(i=0; ;i++) {
    if(e[i]) cnt++;
    if(cnt == n+1) break;
  }
  return i;
}
/* break -> i++しない？*/
int main(void)
{
  int i,j,k;
  int e[9];
  int f[9];
  int n,m;
  int a,b,c;
  int cnt;
  int kaizyou_now;
  int score[100][100] = {0};
  int rep = 0;
  scanf("%d %d",&n,&m);
  rep(i,m) {
    scanf("%d %d %d",&a,&b,&c);
    score[a][b] = c;
  }
  kaizyou_now = kaizyou(n);
  for(i = 0; i < kaizyou_now; i++) {
    for(j=0; j<n; j++) {
      e[j] = 1;
    }
    int num = n;
    int num2 = i;
    while(num) {
      f[num-1] = e_cnt(e,num2%num);
      e[e_cnt(e,num2%num)] = 0;
      num2 /= num;
      num--;
    }
    int tmp = 0;
    for(j=0;j<n;j++) {
      for(k=j+1;k<n;k++) {
        tmp += score[f[j]][f[k]];
      }
    }
    if(rep < tmp) rep = tmp;
  }
  printf("%d\n",rep);
  return 0;
}