#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <queue>
using ll = long long;
using namespace std;

struct Data
{
    int item1, item2, score;
};

vector<int> v;
vector<Data> arr;
int main(void)
{
    int N, M;
    cin >> N >> M;
    for (int i = 0; i < N; ++i)
        v.push_back(i);

    for (int i = 0; i < M; ++i)
    {
        Data d;
        cin >> d.item1 >> d.item2 >> d.score;
        arr.push_back(d);
    }

    int ans = 0;

    do
    {
        int t = 0;
        for (int i = 0; i < M; ++i)
        {
            if (v[arr[i].item1] < v[arr[i].item2])
                t += arr[i].score;
        }
        ans = max(ans, t);
    } while (next_permutation(v.begin(), v.end()));

    cout << ans << endl;
    return 0;
}