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: [[-16, -86, -146, -2, 45, -193, 6], [-125, -194, 40, 86, 15, -146, -131], [-150, 75, 6, -6, -39, -138]]

SOLUTION: [45, 86, 75]

PROBLEM: [[-88, -78, -21], [-154, -184, -116, -32, -111, -121], [-14, -137, -43, -117], [-75, 38, -76, -138, -108, -102, 42], [12, -66, -91, 100, -55, 2]]

SOLUTION: [-21, -32, -14, 42, 100]

PROBLEM: [[-77, -85, -177, -98, -27, 94, -135], [-32, 28, -192, -28, -198, -155, 92], [-27, -143, 57, -58], [73, 98, -166, -114, 43, 95], [-160, 8], [-162, -120, -35], [-97, -66, -80, 20, 60, 55], [-53, -171, -110], [-26, 1, -131]]

SOLUTION:
[94, 92, 57, 98, 8, -35, 60, -53, 1]