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: [[27, -66, -118], [-10, -97], [-130, 40, -199, -19, -165], [-139, -159, -28, 78, 25, 63], [74, -61], [-143, -75, -151, 22, -138, -46], [-11, -2, 51, -160, -108]]

SOLUTION: [27, -10, 40, 78, 74, 22, 51]

PROBLEM: [[-123, -64, -37, -55], [-170, -193, 73, 94], [-21, -159, -100], [-59, -193, -156, 76], [21, -147, -140, -165, 85, -14], [-51, 57, 85, 1, -69, 93], [-156, -17, 72], [-48, -165, -96, -148, 5, -147], [-81, -55, 87, -12, -9]]

SOLUTION: [-37, 94, -21, 76, 85, 93, 72, 5, 87]

PROBLEM: [[48, -150, 94, 39], [-32, 96, -184, -76], [-14, -180, -8], [-144, 70], [-102, -41]]

SOLUTION:
[94, 96, -8, 70, -41]