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: [[95, -100, -10], [-52, -130, -16, -86, -37, -181], [-126, -10, 3, -135, -67, 64, -5], [-101, -96, -155, -12, -63], [-130, -187, 20, 45], [-176, 87, -135, -75, -90, -189, -200], [-53, 74, -52, 29, -150], [-192, 48, -15, -148, -175], [75, -148]]

SOLUTION: [95, -16, 64, -12, 45, 87, 74, 48, 75]

PROBLEM: [[91, -30, -165, -83, -18, 16], [-187, -77, -17, -151, -93, -151], [-135, -172, 18, 64, -60, 7, -119], [-189, 38, 81, 6, -68, -147, -36], [54, -171], [-139, 100, 28, -55, 52, 21, 82]]

SOLUTION: [91, -17, 64, 81, 54, 100]

PROBLEM: [[-144, 79, -179, 71, -137], [-173, 3, -75, 80, -147], [-33, -137, 8, -51], [-180, 64], [47, -41, 3, 46, 1, -160, 30], [-82, -195, -68], [-101, 88]]

SOLUTION:
[79, 80, 8, 64, 47, -68, 88]