import std.stdio : readln, write, writef, writeln, writefln;
import std.string : chomp;
import std.array : array, split;
import std.conv  : to;
import std.range.primitives;
import std.range : enumerate, iota, repeat, retro, zip, assumeSorted;
import std.algorithm.searching  : all, any, canFind, count, countUntil;
import std.algorithm.comparison : max, min, clamp;
import std.algorithm.iteration  : each, group, filter, map, reduce, permutations, sum, uniq;
import std.algorithm.sorting    : sort;
import std.algorithm.mutation   : reverse, swap;
import std.typecons : Tuple;
import std.container;

void main() {
    int n,m;
    scan(n,m);

    auto t = new int[][](n, n);

    foreach (i ; 0 .. m) {
        int a,b,c;
        scan(a,b,c);
        t[a][b] = c;
    }

    auto dp = new int[][](1<<n, n);

    foreach (s ; 0 .. 1<<n) {
        foreach (v ; 0 .. n) {
            if (!(s & (1<<v))) continue;
            int s2 = s ^ (1<<v);

            foreach (u ; 0 .. n) {
                if (s2 & (1<<u)) {
                    dp[s][v] = max(dp[s][v], dp[s2][u]);
                }
            }
            foreach (u ; 0 .. n) {
                if (s2 & (1<<u)) {
                    dp[s][v] += t[u][v];
                }
            }
        }
    }

    int ans;

    foreach (i ; 0 .. n) {
        ans = max(ans, dp[(1<<n)-1][i]);
    }

    ans.writeln;
}




void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.array : split;
    import std.conv  : to;
    import std.range.primitives;

    string[] line = readln.split;
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}



void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}