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: [[-73, 76, -100, -143], [-74, -141], [73, -82, -103, -88, 70, -159, -124], [-110, -78, 44, 57, -61], [41, -83, -173, -44, -181]]

SOLUTION: [76, -74, 73, 57, 41]

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: [[67, 86, 4], [-163, 92, -59, -1, -131, -68], [35, -185, -178, -45, 39, -194], [-194, 75], [-185, -31, 37, -26, -2, -101], [-90, 58]]

SOLUTION:
[86, 92, 39, 75, 37, 58]