#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int n, m;
    cin >> n >> m;
    int f[n][n];
    rep(i,n)rep(j,n)f[i][j] = 0;
    rep(i,m){
        int x,y,z;
        cin >> x >> y >> z;
        f[x][y] = z;
    }

    int ans = 0;

    int a[n];
    rep(i,n)a[i] = i;

    do{
        // rep(i,n)cout << a[i];
        // cout << endl;
        int tmp = 0;
        rep(i,n){
            srep(j,i+1,n){
                tmp += f[a[i]][a[j]];
            }
        }
        ans = max(ans, tmp);
    }while(next_permutation(a, a+n));

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