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, 12], [-33, -163, -183, -45, -110, -33, -10], [-186, -48], [-35, -145, -161]]

SOLUTION: [12, -10, -48, -35]

PROBLEM: [[-181, -160, -10, -6, -128], [78, -145, -191, -36]]

SOLUTION: [-6, 78]

PROBLEM: [[32, -65], [-176, -176], [-145, 17, -14, 39, 11, 47, 49], [-32, -180, -20], [-139, 11, 89, -112, -26, -177]]

SOLUTION:
[32, -176, 49, -20, 89]