use std::cmp::max;

fn next_permutation(lists: &mut Vec<usize>) -> bool {
  let n = lists.len();
  let mut i: usize = n - 1;
  while i >= 1 && lists[i - 1] > lists[i] {
    i -= 1;
  }

  if i == 0 { return false; }
  let mut j: usize = i;

  while j + 1 < n && lists[i - 1] < lists[j + 1] {
    j += 1;
  }
  lists.swap(i-1, j);

  let mut s: usize = i;
  let mut t: usize = n - 1;
  while t > s {
    lists.swap(s, t);
    s += 1;
    t -= 1;
  }

  true
}

fn main() {
    let mut nm = String::new();
    std::io::stdin().read_line(&mut nm).ok();
    let nm: Vec<usize> = nm.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
    let n = nm[0];
    let m = nm[1];
    let mut scores: Vec<Vec<usize>> = vec![vec![0; n]; n];
    for _ in 0..m {
        let mut abc = String::new();
        std::io::stdin().read_line(&mut abc).ok();
        let abc: Vec<usize> = abc.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
        scores[abc[0]][abc[1]] = abc[2];
    }

    let mut base: Vec<usize> = (0..n).collect();
    let mut score: usize = 0;
    loop {
        let mut temp: usize = 0;
        for i in 0..n {
            for j in (i+1)..n {
                temp += scores[base[i]][base[j]];
            }
        }
        score = max(score, temp);
        if !next_permutation(&mut base) { break; }
    }
    println!("{}", score);
}