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: [[-153, -42, -80], [4, 30], [87, -57, -137, -85, -188, -158], [-89, -68, -173, 34]]

SOLUTION: [-42, 30, 87, 34]

PROBLEM: [[-4, -199, -162, 33], [25, -194, -157, -39, -122, 100, -108], [-25, -181, 74, -116, -119], [69, -124]]

SOLUTION: [33, 100, 74, 69]

PROBLEM: [[12, 75, -66, 16, 68, -167], [-61, 8, -85, 13, -173, -175, -10], [-171, -107, -118, -147, -138, -139, -22], [-37, -173, -64, 98, 31], [59, -122, 32, -46, 97], [-44, 49, 29, 93, 57, -105, -120], [-104, -102, -153, -154, 75, -155], [-46, -85, -126, -3, 92, 32, 9], [-169, -121, -86, -7]]

SOLUTION:
[75, 13, -22, 98, 97, 93, 75, 92, -7]