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

int main() {
  int n, m;
  cin >> n >> m;
  vector<int> item1(m), item2(m), score(m);
  rep(i, m) cin >> item1[i] >> item2[i] >> score[i];
  vector<int> p(n);
  rep(i, n) p[i] = i;
  int ans = 0;
  do {
    vector<int> pos(n);
    rep(i, n) pos[p[i]] = i;
    int s = 0;
    rep(i, m) if (pos[item1[i]] < pos[item2[i]]) s += score[i];
    ans = max(ans, s);
  } while (next_permutation(p.begin(), p.end()));
  cout << ans << endl;
  return 0;
}