TASK DEFINITION: In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.
PROBLEM: [[-42, -152, -122, -79], [-85, 39, 36, -53], [83, 52], [-31, -2, -176, -152, -107, 44, 62], [10, -163, -16], [44, 33, 55, -59, 1, -30, -19]]

SOLUTION: [-42, 39, 83, 62, 10, 55]

PROBLEM: [[-19, -69, -153, -73], [-136, -112, -133], [30, -31], [59, -147, -105, 23, 54], [49, -59, 65, -41, -42, 22], [-133, -88, -102, -7], [-16, -96, -138, -48, -52], [-95, 86, -35, 37, 59, -151], [39, -117, -124, -196]]

SOLUTION: [-19, -112, 30, 59, 65, -7, -16, 86, 39]

PROBLEM: [[12, 23, -109], [-77, 9, -200, -188, 88, -166, -147], [46, -146, -99, -43, 47, 58, -100], [-32, 16], [-159, 98], [-36, 32, -164, -34, 9]]

SOLUTION:
[23, 88, 58, 16, 98, 32]