using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace Yukicoder
{
    public static class Algorithm
    {
        public static bool NextPermutation<T>(T[] array, int start, int length)
            where T : IComparable
        {
            int end = start + length - 1;

            if (end <= start) return false;

            int last = end;
            while (true)
            {
                int pos = last--;

                if (array[last].CompareTo(array[pos]) < 0)
                {
                    int i;
                    for (i = end + 1; array[last].CompareTo(array[--i]) >= 0; ) { }
                    T tmp = array[last]; array[last] = array[i]; array[i] = tmp;
                    Array.Reverse(array, pos, end - pos + 1);
                    return true;
                }
                if (last == start)
                {
                    Array.Reverse(array, start, end - start);
                    return false;
                }
            }

            throw new Exception("NextPermutation: Fatal error");
        }
    }

    class Program
    {
        static void Main(string[] args)
        {
            var first = Console.ReadLine().Split(' ').Select(int.Parse).ToArray();
            var n = first[0];
            var m = first[1];
            int[,] score = new int[n+1,n+1];
            for (int i = 0; i < n + 1; i++)
            {
                for (int j = 0; j < n + 1; j++)
                {
                    score[i, j] = 0;
                }                
            }
            for (int i = 0; i < m; i++)
            {
                var line = Console.ReadLine().Split(' ').Select(int.Parse).ToArray();
                score[line[0], line[1]] = line[2];
            }
            var permutation = new int[n];
            for (int i = 0; i < n; i++)
            {
                permutation[i] = i;
            }
            var maxScore = 0;
            while (true)
            {
                var sum = 0;
                for (int i = 0; i < permutation.Length - 1; i++)
                {
                    for (int j = i+1; j < permutation.Length; j++)
                    {
                        sum += score[permutation[i], permutation[j]];
                    }                
                }
                maxScore = Math.Max(maxScore, sum);
                if (!Algorithm.NextPermutation(permutation, 0, n))
                {
                    break;
                }
            }
            Console.WriteLine(maxScore);
        }
    }
}