#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {
    int n,m;
    cin>>n>>m;
    int a[n][n] {};
    for (int i = 0; i < n; i++) {
        int b, c, d;
        cin>>b>>c>>d;
        a[b][c]=d;
    }
    int b[n];
    for (int i=0;i<n;i++)b[i]=i;
    int ans=0;
    do {
        int sm=0;
        for (int i=0;i<n;i++)
            for(int j=i+1;j<n;j++)
                sm+=a[b[i]][b[j]];
        ans=max(ans,sm);
    } while(next_permutation(b, b+n));
    cout<<ans<<endl;
    return 0;
}