pub fn part2(input: &[u32]) -> u32
We want the number of combinations with the fewest containers, so find first non-zero value.