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: [[-176, 36, 94, 7, 55, 29], [-66, 24, -23, -199, -43, -40], [-99, -187, -132, -129, 12]]

SOLUTION: [94, 24, 12]

PROBLEM: [[-57, -10, -27, -160], [-80, -130, -16, 25], [-65, -106, 30, -104, -20, 77], [-192, -87, -49, 64, 43, 94, 82], [-81, -10, 20, -28, 79, 73, -1], [-191, -83, -113, 40, 6]]

SOLUTION: [-10, 25, 77, 94, 79, 40]

PROBLEM: [[-83, -144, 26], [-143, 64, 16], [-75, 57, -33, -82, 27, -27], [50, -196, 64, -9, -130], [31, -14, 36], [24, -7, -182, -188]]

SOLUTION:
[26, 64, 57, 64, 36, 24]