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: [[-45, 100, 36, -80, 90], [-117, 80, -105, 86], [45, -168, -148, 87, -195, -102]]

SOLUTION: [100, 86, 87]

PROBLEM: [[99, -128, -21, -121, -117, -92], [-48, -9, -141, -18, -95], [-20, -29, -22, -193]]

SOLUTION: [99, -9, -20]

PROBLEM: [[-18, -69, 27, -166, -146, -169], [-11, -183, -102, -104, -33, 65, -19], [-27, -147], [-41, -126, -9, -125], [-28, -26], [-33, -92]]

SOLUTION:
[27, 65, -27, -9, -26, -33]