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: [[40, -40, -148, -172], [-116, -46, 92, -51, -20], [-161, -93, 46, -56], [3, -153, 79, -38, 62, -57]]

SOLUTION: [40, 92, 46, 79]

PROBLEM: [[100, -56, -195, -111], [-102, -4, -87, -166, -68, 84, -157], [-63, -119, -190], [-144, -55], [-103, 19, 5, 78, -135, -153], [58, 15, -108, -178], [36, 73, -175, -74, -179, 86], [29, 41, 99, -75, -22, -174]]

SOLUTION: [100, 84, -63, -55, 78, 58, 86, 99]

PROBLEM: [[-12, -150, 54], [-192, -3, 5, 1], [-188, -155, -193], [8, -83, -177, 12, -38, -151, -27]]

SOLUTION:
[54, 5, -155, 12]