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: [[-108, -173, -55, -190], [-41, -89, -136, 96, -165, 57, 98], [-27, -150, -182, -32]]

SOLUTION: [-55, 98, -27]

PROBLEM: [[-21, -17, -178, 61, -92, -68], [-171, 1, -185, 17, -19, 4, -95]]

SOLUTION: [61, 17]

PROBLEM: [[-106, -146, 41, 32], [57, 29, -131, 76, -15], [17, -156, -152, 16, 87, 69], [-20, 21, 59, -113, -198, -113, -63], [23, -159], [-188, -35, 76, -130, -90, -9], [-123, 32, -19, -93], [-20, -35, 83, 87, -162, 93]]

SOLUTION:
[41, 76, 87, 59, 23, 76, 32, 93]