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: [[-4, 11], [12, -196, -120, 66, -157, -72]]

SOLUTION: [11, 66]

PROBLEM: [[-130, -20, -171, -122, 49, -43], [-173, -82, 17], [87, -55, -70, -113], [69, 10, -121, -177]]

SOLUTION: [49, 17, 87, 69]

PROBLEM: [[24, 68, 96, 25, -54], [-187, -66, -62, 73, 47, 92, -102], [-100, -53], [-140, -8, -11]]

SOLUTION:
[96, 92, -53, -8]