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: [[-103, 40, 28, -155], [-74, 84, -82, -72, -91, -91, -145], [-88, -160, -49, 38, 55]]

SOLUTION: [40, 84, 55]

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: [[16, -79, -14, -196], [-132, -23, -26, 100, 33], [-197, 14, -69, -132, -38, 97], [0, -64, -110, -18, -122, 57, 24], [91, -112], [-40, -128, -12, -146, -44, -188, -76], [-110, -186, -107, 6, -94, -168], [45, -78, -116, -63], [52, 9, -58, -98]]

SOLUTION:
[16, 100, 97, 57, 91, -12, 6, 45, 52]