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: [[-79, 48, -148], [-119, -87], [-60, 96, -89, -162], [-171, 8, 54], [16, -66, 91, -22, 4, 39, -60], [58, -143, -29], [-24, -23]]

SOLUTION: [48, -87, 96, 54, 91, 58, -23]

PROBLEM: [[-134, -48, 4, 24, 71, -187, -166], [44, 10, 44, -55], [-63, -29, 15, -89, 78, 63, -106], [-112, -11, -134, 87, -46], [-128, -93, 68, -87], [-147, -63, 91]]

SOLUTION: [71, 44, 78, 87, 68, 91]

PROBLEM: [[-98, -162, 48, -73], [-157, 41, -150, -46, -80], [94, -179, -2, -3, -50, 50, -141], [-42, -1, 28, 98, -70], [67, -197, -127, -71, -95, -104], [-57, -71, 84, 63, -67, 0, -100], [-166, -105, -84, -181, -104], [-29, 32, 62], [67, 41, -177, 79, -184]]

SOLUTION:
[48, 41, 94, 98, 67, 84, -84, 62, 79]