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, -43, 9], [-4, -170, 48, -129, 49, 83], [41, -102, -98, 81], [27, -183, 93, 47, -13, 51], [2, -61, -170, -73, 48], [2, -118, -152, -141], [-168, -73, -166], [15, 50, 32, 4]]

SOLUTION: [9, 83, 81, 93, 48, 2, -73, 50]

PROBLEM: [[-58, -176, 95, -113, 67, -164], [97, 98, -87, 68], [57, 21, 86]]

SOLUTION: [95, 98, 86]

PROBLEM: [[-98, 63, -146, 56, -111, 29], [15, -79, -127], [-64, -175], [-142, -125, -69]]

SOLUTION:
[63, 15, -64, -69]