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: [[-190, 12, -59, 9, 100, 83], [-187, 40, 97, 8, -29], [77, -190], [-153, 11], [17, -89, -75, 52, -112, -52, 51], [-60, -103, -79, 74], [-86, -4, 55, 99], [-69, -25, -52], [8, -62]]

SOLUTION: [100, 97, 77, 11, 52, 74, 99, -25, 8]

PROBLEM: [[96, -174], [-117, 48, -174, 19, -26, -7], [-151, 65, 16, -195], [19, 15], [-136, -26], [-118, -82, 95, 67], [-80, -160, -30, -94, -11, -55]]

SOLUTION: [96, 48, 65, 19, -26, 95, -11]

PROBLEM: [[-164, 16, -154, 55], [-6, 24, 89, 84, -143, 67, -182], [67, -130, 14, 43]]

SOLUTION:
[55, 89, 67]