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: [[83, -105, -170, -58, -169, -177], [79, -174, 31], [34, 33, -127], [-141, 49, -55], [-48, 11, -2, -9, -21], [-75, -46, -144, -106, -46, -35, 75], [-6, -177, -101], [67, 44, -184, -93, -106, 41], [-135, -96]]

SOLUTION: [83, 79, 34, 49, 11, 75, -6, 67, -96]

PROBLEM: [[-46, -51, 17, -87, -149, -81], [12, -154, -56]]

SOLUTION:
[17, 12]