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, -107, -111, -52, -133, 80], [-150, 54, 88, -69, 6], [84, -113, 35, -189, -49, -77, 19], [99, -97, -161, 61, -66, -73, 18], [34, -141]]

SOLUTION: [80, 88, 84, 99, 34]

PROBLEM: [[-49, -181, -26, -69], [-2, 61, -87, 2, -166, -161]]

SOLUTION: [-26, 61]

PROBLEM: [[-51, 3, -75, -86, -110, -137, -47], [42, 34, -165, 70], [-63, -151, -78, -120, -197], [-112, -145, -121, -188, 95, 11, -185], [14, -104, -57, 68, 29, -118, -187]]

SOLUTION:
[3, 70, -63, 95, 68]