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: [[60, -121, -47, -34, -99], [-172, 26], [-87, 61, -54, 39], [-150, 74, -19, -90, 53], [-116, -189, -28, -36]]

SOLUTION: [60, 26, 61, 74, -28]

PROBLEM: [[-176, 16, -88, 98, -44], [-156, -113, -11], [25, -32, -27, 98, -103, -77, -111], [8, -82, -157, 26, -176, -52, -180], [-77, -200, -183, -59, -143, 10]]

SOLUTION: [98, -11, 98, 26, 10]

PROBLEM: [[28, 76, -144, -69, -45, 31, -179], [71, -15, 69, -58, -56]]

SOLUTION:
[76, 71]