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: [[-16, -4, -100, -51, 2], [32, 53, 72, -32, 24], [6, 60, -111, -198, -123]]

SOLUTION: [2, 72, 60]

PROBLEM: [[-79, -29, 95, 11, -47, -37], [-61, -14, 2, 63, 18, -44, 60], [67, -61, -152, -108, -184, 85], [-7, -135, -113, -81, -146, -34], [74, 58], [-139, 40, -181, -95], [83, -28, -200], [80, -130, -174, 36, 19], [12, 70, -198, -62]]

SOLUTION: [95, 63, 85, -7, 74, 40, 83, 80, 70]

PROBLEM: [[-184, 15], [-154, -67, -16, 27, -2]]

SOLUTION:
[15, 27]