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: [[-138, -72], [-151, 92, -186, 54], [-169, -71, 6, -69, 0, 15]]

SOLUTION: [-72, 92, 15]

PROBLEM: [[-12, 25, 90, -161, -90, -10, -71], [5, -63, -36, 98, -7], [20, -168, 22, -198], [-89, 83, -185, -69, -110, 85], [-7, -27, 3, 64, -132, 36, -40], [37, 68, 77, -51], [-143, 48, -53, 6, 63, 58], [-162, -152]]

SOLUTION: [90, 98, 22, 85, 64, 77, 63, -152]

PROBLEM: [[-179, -10, 56], [-38, 89, -24, -120], [-56, 99]]

SOLUTION:
[56, 89, 99]