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, -195, -66], [-6, -45, -30, -34, -43], [91, -127, -170, 11], [-127, 69, -126, -88], [-195, -24, -70, -91], [72, -1, -139, -122, -189]]

SOLUTION: [-66, -6, 91, 69, -24, 72]

PROBLEM: [[-101, -168], [17, 42, -110, 20], [83, -36]]

SOLUTION: [-101, 42, 83]

PROBLEM: [[88, -177, -189], [39, 52, 91, -28, -61, 22, -121], [-76, 27, -100], [-152, -39, -183, -5, -188, -181]]

SOLUTION:
[88, 91, 27, -5]