#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define RREP(i,s,e) for (i = e-1; i >= s; i--)
#define rrep(i,n) RREP(i,0,n)
#define REP(i,s,e) for (i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)
#define INF 1e8

typedef long long ll;

int main() {
    int i, j, n, m, ans;
    int s[9][9] {};
    vector<int> item;
    cin >> n >> m;
    rep (i,n) item.push_back(i);
    rep (i,m) {
        int item1, item2, score;
        cin >> item1 >> item2 >> score;
        s[item1][item2] = score;
    }
    ans = 0;
    do {
        int score = 0;
        rep (i,n-1) REP (j,i+1,n) score += s[item[i]][item[j]];
        ans = max(ans,score);
    } while (next_permutation(item.begin(),item.end()));
    cout << ans << endl;
    return 0;
}