#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define pb(a) push_back(a)
#define rd(a) cin>>(a)
#define RD(a,b) cin>>(a)>>(b)
#define pr(a) cout<<(a)<<endl
#define PR(a,b) cout<<(a)<<" "<<(b)<<endl
#define F first
#define S second
#define ll long long
bool check(int n,int m,int x,int y){return (x<0||x>=n||y<0||y>=m)?false:true;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};
typedef pair<int,int> P;

int main() {
  int n,m;
  RD(n,m);
  vector<P> v(m);
  int d[n][n];
  memset(d,0,sizeof(d));
  rep(i,m) {
    int x,y,z;
    cin >> x >> y >> z;
    v[i]=P(x,y);
    d[x][y]=z;
  }
  int ans=0;
  vector<int> a(n);
  rep(i,n) a[i]=i;
  do {
    int c[n];
    rep(i,n) c[a[i]]=i;
    int sum=0;
    rep(i,m) {
      int x=v[i].F,y=v[i].S;
      if(c[x]>c[y]) sum+=d[x][y];
    }
    ans=max(ans,sum);
  } while(next_permutation(all(a)));
  pr(ans);
  return 0;
}