#include<iostream>
#include<math.h>
#include<vector>
#include <array>
#include <algorithm>
#include <queue>
#include <numeric>
#include <map>

using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) //printf(__VA_ARGS__)

typedef pair<int, int> pos;
int pos::*x = &pos::first;
int pos::*y = &pos::second;

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/
int mat[100][100]; // 点数対応
int N, M;
int V[10];

signed main()
{
    cin >> N >> M;
    
    int x, y;
    REP(i, M) {
        cin >> x >> y;
        cin >> mat[x][y];
    }

    REP(i, N) V[i] = i;

    int ma = 0;
    do {
        int sc=0;
        REP(x,N) REP(y,x) sc+=mat[V[y]][V[x]];
        ma = max(ma,sc);
    } while(next_permutation(V,V+N));

    cout << ma << endl;

    return 0;
}