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: [[84, -51, -87, 46], [-166, -93, -6, 1], [-128, -26, 26, 35, -48], [-198, -78, -151], [24, -176, -142, -169, -21, -44], [7, -142, -118, 87, 66, -29, -121]]

SOLUTION: [84, 1, 35, -78, 24, 87]

PROBLEM: [[-184, -9, -39, 19, -2], [-122, -141, -96, -147], [-100, -186, 60, 52], [43, 38, -18, -20, -150, -40, 50], [63, -70, -158], [58, 38, 42, -13, -61, 30, -129], [1, 92, -75, 2, -7, -88], [-63, -192, -194, 44, 67, 20, -100]]

SOLUTION: [19, -96, 60, 50, 63, 58, 92, 67]

PROBLEM: [[68, 25, 94, -193, -131, -111, 17], [2, -45, -21, -200, 100, -186], [-87, 48], [-46, 11, 56]]

SOLUTION:
[94, 100, 48, 56]