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: [[-7, 38, 91, -146, -16, -169], [48, -155, 86, -44, 100, -92, 31], [-114, -7, -28, 51, 86, -4, 76], [84, 82, 71], [13, 2], [22, 53, -152], [-32, -137, -157], [-55, 14, -129, -58, 54, -10]]

SOLUTION: [91, 100, 86, 84, 13, 53, -32, 54]

PROBLEM: [[84, -86, 87, -13, 3, -132, 58], [41, -141, -89], [45, 53, 6, -87]]

SOLUTION: [87, 41, 53]

PROBLEM: [[-83, 3, 92, 37, 6, -146], [36, -27, -173, -105, -98], [-159, -26, -44], [-118, -107, -115], [-169, 52, -3, 64], [-117, -51, -56, 13], [-139, 38, 80, -13, -122]]

SOLUTION:
[92, 36, -26, -107, 64, 13, 80]