package main

import "fmt"
import "sort"

func compare(a, b []int) int {
	for i := 0; i < len(a) && i < len(b); i++ {
		switch {
		case a[i] > b[i]:
			return 1
		case a[i] < b[i]:
			return -1
		}
	}
	switch {
	case len(a) > len(b):
		return 1
	case len(a) < len(b):
		return -1
	}
	return 0
}

func nextPermutation(seq []int) bool {
	var j int = -1
	var m int = -1

	// Attempt to find the j index, this is the first index where it's value is
	// less than the after it (i.e. seq[j] < seq[j+1])
	for index := len(seq) - 2; index >= 0; index-- {
		if seq[index] < seq[index+1] {
			j = index
			break
		}
	}

	// If no index was found then finish
	if j == -1 {
		return false
	}

	// Find the m index, this is the first index where the value is greater than
	// the value at j
	for index := len(seq) - 1; index > j; index-- {
		if seq[index] > seq[j] {
			m = index
			break
		}
	}

	// Swap the values at the two indexes
	seq[j], seq[m] = seq[m], seq[j]

	// Order all of the values after j
	upper := seq[j+1:]
	sort.Ints(upper)

	for i, v := range upper {
		seq[j+i+1] = v
	}

	return true
}

func Next(seq []int) bool {
	current := make([]int, len(seq), len(seq))
	copy(current, seq)

	for i := 1; i < len(seq); i++ {
		success := nextPermutation(seq)
		if compare(current, seq) != 0 {
			return success
		}
	}

	return false
}

func get(seq []int, val int) int {
	for i, v := range seq {
		if v == val {
			return i
		}
	}
	return -1
}

func main() {
	var n, m int
	fmt.Scan(&n, &m)
	a := make([]int, m)
	b := make([]int, m)
	c := make([]int, m)
	for i, _ := range a {
		fmt.Scan(&a[i], &b[i], &c[i])
	}

	v := make([]int, n)
	for i, _ := range v {
		v[i] = i
	}

	ans := 0
	for {
		cnt := 0
		for i, _ := range a {
			p := get(v, a[i])
			q := get(v, b[i])
			if p < q {
				cnt += c[i]
			}
		}
		if ans < cnt {
			ans = cnt
		}

		res := Next(v)
		if !res {
			break
		}
	}
	fmt.Println(ans)
}