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: [[-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: [[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: [[90, 15], [-4, -32], [-14, -7, -188, -117], [-76, -184, -103, 19], [-186, -42, 22, -128, -135, 90, -29], [-137, 24, -169, 23, -133]]

SOLUTION:
[90, -4, -7, 19, 90, 24]