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: [[-15, 9, -181, -172, -74], [-164, -77, 1, -65, 29, -113, -163], [-189, -106, 22, -40, -50, -48], [-77, -61, 16, 85, 36, -45, -26], [2, 77, -77], [-146, -87, 75, -163, -147]]

SOLUTION: [9, 29, 22, 85, 77, 75]

PROBLEM: [[-162, -197, 57, -149], [71, -127, 21, -120, 56, -18, 82], [-18, 1, -152, -113, 5, -53], [-138, 28], [70, -65]]

SOLUTION: [57, 82, 5, 28, 70]

PROBLEM: [[14, -180], [21, -158, 0, -96, -171, -22, 2], [-44, 26, 75, -192, -1, -46], [-151, -38, -159], [-128, 55, -167, 68]]

SOLUTION:
[14, 21, 75, -38, 68]