fn run(sc: &mut scanner::Scanner, out: &mut std::io::BufWriter) { let t: u32 = sc.next(); for _ in 0..t { let n: usize = sc.next(); let w: usize = sc.next(); let a: Vec = sc.next_vec(n); let ans = solve(w, a); writeln!(out, "{}", ans).ok(); } } fn solve(len: usize, a: Vec) -> usize { let w = std::mem::size_of::() * 8; let mut dp = vec![0usize; len / w + 1]; dp[0] = 1; for a in a { let q = a / w; let r = a % w; if r == 0 { for i in (q..dp.len()).rev() { dp[i] |= dp[i - q]; } } else { for i in ((q + 1)..dp.len()).rev() { dp[i] |= dp[i - q] << r; dp[i] |= dp[i - q - 1] >> (w - r); } dp[q] |= dp[0] << r; } } (0..=len).rfind(|i| dp[i / w] >> (i % w) & 1 == 1).unwrap() } // ---------- begin scannner ---------- #[allow(dead_code)] mod scanner { use std::str::FromStr; pub struct Scanner<'a> { it: std::str::SplitWhitespace<'a>, } impl<'a> Scanner<'a> { pub fn new(s: &'a String) -> Scanner<'a> { Scanner { it: s.split_whitespace(), } } pub fn next(&mut self) -> T { self.it.next().unwrap().parse::().ok().unwrap() } pub fn next_bytes(&mut self) -> Vec { self.it.next().unwrap().bytes().collect() } pub fn next_chars(&mut self) -> Vec { self.it.next().unwrap().chars().collect() } pub fn next_vec(&mut self, len: usize) -> Vec { (0..len).map(|_| self.next()).collect() } } } // ---------- end scannner ---------- use std::io::Write; use std::collections::*; type Map = BTreeMap; type Set = BTreeSet; type Deque = VecDeque; fn main() { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); let mut sc = scanner::Scanner::new(&s); let out = std::io::stdout(); let mut out = std::io::BufWriter::new(out.lock()); run(&mut sc, &mut out); }