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: [[61, -157, 48], [29, 77, -102, -122, 50, 25, -186], [44, -84, -172, -97, -142], [-194, 62, -5, -145, 93]]

SOLUTION: [61, 77, 44, 93]

PROBLEM: [[-6, -62], [-113, -61, -143, 51, -4, -120, -139], [-158, -24, 22, 71], [98, -148, 36, -108, -144], [-30, -122, -47], [26, 11, -59, -47, -95]]

SOLUTION: [-6, 51, 71, 98, -30, 26]

PROBLEM: [[40, -156], [-1, -65, -42, 92, -153, -87], [-120, -177], [-115, 59, 13, 82, -108, -114, 38], [-117, -80, -48, 5, -112, -67, 98], [84, 24, 43, -124, -162, 53], [-130, -40, 59, 77, -2, -46, -151], [38, -55, 81, -159, -199]]

SOLUTION:
[40, 92, -120, 82, 98, 84, 77, 81]