#include <bits/stdc++.h>

using namespace std;

int main() {
  int N, M;
  scanf("%d %d", &N, &M);

  vector< vector<int> > table(N, vector<int>(N, 0));
  for (int i = 0; i < M; ++i) {
    int a, b, c;
    scanf("%d %d %d", &a, &b, &c);
    table[a][b] = c;
  }

  vector<int> items(N);
  iota(items.begin(), items.end(), 0);

  int ans = -1;
  do {
    int tmp = 0;
    for (int i = 0; i < N - 1; ++i) {
      for (int j = i + 1; j < N; ++j) {
	tmp += table[items[i]][items[j]];
      }
    }
    ans = max(tmp, ans);
  } while(next_permutation(items.begin(), items.end()));
  printf("%d\n", ans);
  return 0;
}