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: [[-38, -147, 7, 87, 35, -6, -90], [-83, 85, -60, -52, 8, -114, -191]]

SOLUTION: [87, 85]

PROBLEM: [[-66, -108, -51, -41], [-113, 13], [-83, 43], [88, -114, 42, -103, -132, 68, 62], [-164, 15], [10, 32, -120, 32], [-132, -140, -73, 33], [-27, -174, 2, 57, -113]]

SOLUTION: [-41, 13, 43, 88, 15, 32, 33, 57]

PROBLEM: [[-147, -31, 85, -147], [65, -128, -200], [67, -77]]

SOLUTION:
[85, 65, 67]