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: [[-97, -84], [-75, -51, 27, 64, -149, -46], [1, 62], [-8, -1, -122, -47], [-178, 88, 63, -49, -82, -1, -90], [-138, -192, -122, -71, -112]]

SOLUTION: [-84, 64, 62, -1, 88, -71]

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: [[-78, -177], [-161, -190, -177, 32, -183, -148], [-38, 96, -184, 53, -186, -101], [-187, -82], [-38, -58, 43, 11, -110, -19]]

SOLUTION:
[-78, 32, 96, -82, 43]