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: [[-23, 87, 95, -187, -123], [31, 60, 34, -168], [-29, 31, -37], [-163, -122], [-99, 66], [84, 42, -124, 20, -1], [-4, -190, -150, -150, -49, -20, 17]]

SOLUTION: [95, 60, 31, -122, 66, 84, 17]

PROBLEM: [[-9, -162, -58, -49, -137, 75, -173], [34, -149, -90, 9, -162, -82, -117], [81, -33, 96, 3], [33, -86, -48, 20], [-13, -67, 21, -39, -161], [-91, 50], [17, -2]]

SOLUTION: [75, 34, 96, 33, 21, 50, 17]

PROBLEM: [[94, -200], [-199, 50, -108], [-87, 61, 46, -168, 100, 79], [-6, -151, 100, -54, 93, 14], [65, 59, 79, -178, -153, -125, -78], [76, 36, -26, 46, 43], [-76, -17, -72], [20, -45, 17, -106], [-91, -68, -57, -188, -113, -31]]

SOLUTION:
[94, 50, 100, 100, 79, 76, -17, 20, -31]