#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;

int main(){
  int n, m;
  cin >> n >> m;
  vector<vector<int>> it(n, vector<int>(n,0));

  rep(i,m) {
    int a, b, c;
    cin >> a >> b >> c;
    it[a][b] = c;
  } 
  vector<int> idx;
  rep(i,n) idx.push_back(i);
  int res = 0;
  do {
    int tmp = 0;
    for (int i = n-1; i > 0; i--) {
      for (int j = i-1; j >= 0; j--) tmp += it[idx[j]][idx[i]];
    }
    res = max(res, tmp); 
  } while (next_permutation(idx.begin(), idx.end()));
  cout << res << endl;
  return 0;
}