use std::io::Write; use std::collections::*; type Map = BTreeMap; type Set = BTreeSet; type Deque = VecDeque; fn main() { input! { h: usize, w: usize, k: i64, a: [[i64; w]; h], b: [[i64; w]; h], } let row = a.iter().map(|a| a.iter().sum::()).collect::>(); let col = (0..w).map(|j| a.iter().map(|a| a[j]).sum::()).collect::>(); let row_b = b.iter().map(|b| *b.iter().min().unwrap()).collect::>(); let col_b = (0..w).map(|j| b.iter().map(|b| b[j]).min().unwrap()).collect::>(); let mut ans = 0; for i in 0..h { for j in 0..w { let mut row = row[i]; let mut col = col[j]; let p = b[i][j]; let mut q = row_b[i]; let mut r = col_b[j]; if q > r { std::mem::swap(&mut q, &mut r); std::mem::swap(&mut row, &mut col); } if p <= q { let geta = k >> p; row += geta; col += geta; ans.chmax(row * col); } else if p <= r { let geta = (k & ((1 << p) - 1)) >> q; row += geta; let k = k >> p; // 0 <= x <= k // (col + x)(row + x + 2^(p-q)(k - x)) let x = [col, 1]; let y = [row + k * (1 << (p - q)), 1 - (1 << (p - q))]; let (p, q) = (x, y); let a = p[1] * q[1]; let b = p[0] * q[1] + p[1] * q[0]; let c = p[0] * q[0]; ans.chmax(quad_max(a, b, c, 0, k)); } else { let geta = (k & ((1 << r) - 1)) >> q; row += geta; let k = k >> r; // 0 <= x <= k // (col + x)(row + 2^(r - q)(k - x)) let x = [col, 1]; let y = [row + k * (1 << (r - q)), -(1 << (r - q))]; let (p, q) = (x, y); let a = p[1] * q[1]; let b = p[0] * q[1] + p[1] * q[0]; let c = p[0] * q[0]; ans.chmax(quad_max(a, b, c, 0, k)); } } } println!("{}", ans); } // 二次関数ax^2+bx+c , l<=x<=r の最大値 fn quad_max(a: i64, b: i64, c: i64, l: i64, r: i64) -> i64 { assert!(l <= r); let eval = |x: i64| -> i64 { a * x * x + b * x + c }; if a >= 0 { return [l, r].iter().cloned().map(eval).max().unwrap(); } let mut l = l; let mut r = r; while r - l >= 3 { let ll = (l + l + r) / 3; let rr = (l + r + r) / 3; if eval(ll) <= eval(rr) { l = ll; } else { r = rr; } } (l..=r).map(eval).max().unwrap() } // ---------- begin input macro ---------- // reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 #[macro_export] macro_rules! input { (source = $s:expr, $($r:tt)*) => { let mut iter = $s.split_whitespace(); input_inner!{iter, $($r)*} }; ($($r:tt)*) => { let s = { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); s }; let mut iter = s.split_whitespace(); input_inner!{iter, $($r)*} }; } #[macro_export] macro_rules! input_inner { ($iter:expr) => {}; ($iter:expr, ) => {}; ($iter:expr, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($iter, $t); input_inner!{$iter $($r)*} }; } #[macro_export] macro_rules! read_value { ($iter:expr, ( $($t:tt),* )) => { ( $(read_value!($iter, $t)),* ) }; ($iter:expr, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($iter, $t)).collect::>() }; ($iter:expr, chars) => { read_value!($iter, String).chars().collect::>() }; ($iter:expr, bytes) => { read_value!($iter, String).bytes().collect::>() }; ($iter:expr, usize1) => { read_value!($iter, usize) - 1 }; ($iter:expr, $t:ty) => { $iter.next().unwrap().parse::<$t>().expect("Parse error") }; } // ---------- end input macro ---------- // ---------- begin chmin, chmax ---------- pub trait ChangeMinMax { fn chmin(&mut self, x: Self) -> bool; fn chmax(&mut self, x: Self) -> bool; } impl ChangeMinMax for T { fn chmin(&mut self, x: Self) -> bool { *self > x && { *self = x; true } } fn chmax(&mut self, x: Self) -> bool { *self < x && { *self = x; true } } } // ---------- end chmin, chmax ----------