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: [[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: [[94, -71, -83, -154, -126, -62, -104], [-168, 66, 9, -12]]

SOLUTION: [94, 66]

PROBLEM: [[-193, -106, -153], [9, 92, -94], [21, -62, -25], [38, -26, -90, -33, -110], [-190, -96, 76, 92], [-171, 26, 76, -137]]

SOLUTION:
[-106, 92, 21, 38, 92, 76]