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: [[-68, -146], [-144, -187, -188, 43, -177], [91, -149, -134, -36, -122, 44, -100], [-2, -79, 96], [46, -113, 85, -171], [-161, -74, 80, -33]]

SOLUTION: [-68, 43, 91, 96, 85, 80]

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: [[-13, -42, 79], [10, -6, 24, -174, -92], [65, 8, -120, -166, 36], [-181, 25, -196, -180, -44], [-38, 72, 84]]

SOLUTION:
[79, 24, 65, 25, 84]