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: [[9, 77, 13, -72], [-100, 81, -199, -3, -197, -12], [85, 59, -67, -35], [25, 93], [-80, 54], [29, 50, -184, 88, -106]]

SOLUTION: [77, 81, 85, 93, 54, 88]

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: [[-122, 11, -180, 1, -70], [59, 94, -74, -160, -1, -118], [-67, 13, -130, 8, 44, -42, -87], [-106, -17, -156], [24, 24, -45, -160, -46, -148, 11], [-8, 81, -175, -151, -3, -17, -139], [-104, -8, -149, 42], [-76, -102, 16, -169, 84, -13], [-49, 53, -188, 79, -184, 87]]

SOLUTION:
[11, 94, 44, -17, 24, 81, 42, 84, 87]