#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef tuple<int, int, int> TIII;
typedef long long LL;
typedef unsigned long long ULL;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define MP make_pair
#define MT make_tuple
#define SZ(a) int((a).size())
#define EACH(i,c) for(auto i: c)
#define SORT(c) sort((c).begin(),(c).end())

#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()

const double EPS = 1e-10;
const double PI  = acos(-1.0);

#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N, M;
	cin >> N >> M;

	VVI score(N, VI(N));
	REP(i, M){
		int i1, i2, s;
		cin >> i1 >> i2 >> s;
		score[i1][i2] = s;
	}

	VI dp(1 << N, 0);
	vector<set<int>> done(N);
	REP(i, N) done[0].insert(1 << i);

	FOR(i, 1, N){
		REP(j, N){
			EACH(d, done[i - 1]){
				int sum = 0, next = 0;
				if(d & (1 << j)) continue;
				REP(k, N){
					if(d & (1 << k)) sum += score[k][j];
				}
				next = d | (1 << j);
				done[i].insert(next);
				dp[next] = max(dp[next], dp[d] + sum);
			}
		}
	}

	cout << *max_element(ALL(dp)) << endl;

	return 0;
}