#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs exit atof atoi 
#include <cstdio>		// require scanf printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>		// require fabs
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>		// require tolower, toupper
#include <fstream>	// require freopen
#include <ctime>		// require srand
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

const int MAX_N = 12;

int score[MAX_N][MAX_N];
int main()
{
	memset (score, 0, sizeof (score ) );	// item i 行が item j 列より前であれば score 点を獲得できる
	ios_base::sync_with_stdio(0);
	int N, M; cin >> N >> M;
	rep (i, M ) {
		int item1, item2 ; cin >> item1 >> item2;
		cin >> score[item1][item2];
	} // end rep

	string item = "";
	rep (i, N ) item += (char)('0'+ i);
	int res = 0;
	do{
		int curr = 0;
		rep (i, N ){
			for (int j = i+1; j < N; j++ ){
				curr += score[(int)(item[i] - '0')][(int)(item[j] - '0' )];
			} // end for
		} // end rep
//		cerr << "item: " << item << " curr: " << curr << endl;
		res = max (res, curr );
	}while (next_permutation (ALL (item ) ) );
	
	cout << res << endl;

	return 0;
}