#[allow(unused_imports)] use std::cmp::{max, min}; #[allow(unused_imports)] use std::collections::{HashMap, HashSet}; mod util { use std::io::stdin; use std::str::FromStr; use std::fmt::Debug; #[allow(dead_code)] pub fn line() -> String { let mut line: String = String::new(); stdin().read_line(&mut line).unwrap(); line.trim().to_string() } #[allow(dead_code)] pub fn get() -> T where ::Err: Debug, { let mut line: String = String::new(); stdin().read_line(&mut line).unwrap(); line.trim().parse().unwrap() } #[allow(dead_code)] pub fn gets() -> Vec where ::Err: Debug, { let mut line: String = String::new(); stdin().read_line(&mut line).unwrap(); line.split_whitespace() .map(|t| t.parse().unwrap()) .collect() } #[allow(dead_code)] pub fn get2() -> (T, U) where ::Err: Debug, ::Err: Debug, { let mut line: String = String::new(); stdin().read_line(&mut line).unwrap(); let mut iter = line.split_whitespace(); ( iter.next().unwrap().parse().unwrap(), iter.next().unwrap().parse().unwrap(), ) } #[allow(dead_code)] pub fn get3() -> (S, T, U) where ::Err: Debug, ::Err: Debug, ::Err: Debug, { let mut line: String = String::new(); stdin().read_line(&mut line).unwrap(); let mut iter = line.split_whitespace(); ( iter.next().unwrap().parse().unwrap(), iter.next().unwrap().parse().unwrap(), iter.next().unwrap().parse().unwrap(), ) } } #[allow(unused_macros)] macro_rules! debug { ($x: expr) => { println!("{}: {:?}", stringify!($x), $x) } } fn main() { let n: usize = util::get(); let m: usize = util::get(); let a: Vec> = (0..m).map(|_| util::gets()).collect(); let ans = (0..m) .map(|s| { let b = 1000; let mut dp = vec![vec![0; m]; b + 1]; for i in 1..b + 1 { for k in 0..m { if i == 1 { dp[i][k] = a[s][k]; } else { for j in 0..m { dp[i][k] = max(dp[i][k], dp[i - 1][j] + a[j][k]); } } } } let (l, v) = (1..b + 1) .map(|i| (i, dp[i][s])) .max_by_key(|&(l, v)| v * 1000000 / l) .unwrap(); let len = 1000; let mut ans = 0; let mut n = n; if n > len { let c = (n - len) / l; ans += c * v; n = n - c * l; } let mut dp = vec![vec![0; m]; n]; for i in 1..n { for k in 0..m { if i == 1 { dp[i][k] = a[s][k]; } else { for j in 0..m { dp[i][k] = max(dp[i][k], dp[i - 1][j] + a[j][k]); } } } } ans + (0..m).map(|i| dp[n - 1][i]).max().unwrap() }) .max() .unwrap(); println!("{}", ans); }