solve :: [Int] -> [Int] -> Int
solve widths [i, j] = sublist i (j + 1) widths |> minimum
solve :: [Int] -> [Int] -> Int
solve widths [i, j] = sublist i (j + 1) widths |> minimum
solve widths [i, j] = sublist i (j + 1) widths |> minimum