#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define MOD 1000000007
#define INF (1LL<<25)     //33554432
#define PI 3.14159265359
#define EPS 1e-12
//#define int ll

signed main(void)
{
  int n, m, d[10][10];
  cin >> n >> m;
  REP(i, n) REP(j, n) d[i][j] = -1;
  REP(i, m) {
    int a, b, c;
    cin >> a >> b >> c;
    d[a][b] = c;
  }

  VI date;
  REP(i, n) date.push_back(i);
  int ans = -INF;
  do {
    int ret = 0;
    REP(i, n) {
      FOR(j, i+1, n) {
        if(d[date[i]][date[j]] != -1) ret += d[date[i]][date[j]];
      }
    }
    ans = max(ans, ret);
  } while(next_permutation(ALL(date)));

  cout << ans << endl;
  return 0;
}