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: [[-95, 64, 33, -57, -71], [55, -167], [92, -43, -108, -43, -100, -134], [95, -6, 0, 17, -162, -188], [9, 59, 56, 72, -140], [-155, -158, -66, -29], [63, -183]]

SOLUTION: [64, 55, 92, 95, 72, -29, 63]

PROBLEM: [[5, 20], [36, -36, -177, -145], [90, -26, -6, 12, 94]]

SOLUTION: [20, 36, 94]

PROBLEM: [[45, 99, 80], [30, -47, -60, 77]]

SOLUTION:
[99, 77]