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: [[-167, 11, 40, 64], [-136, -48, -90, 19, -124], [54, -157, 3, -24, -62, -92, 84], [-67, -110, -11, -111, 40], [-147, 78, -58]]

SOLUTION: [64, 19, 84, 40, 78]

PROBLEM: [[-51, -127, -52, 18], [-38, 41, -100, -130, -50, 79, 5], [47, -98, -37, 34, -174, -191], [72, -2, -148, -38, -61]]

SOLUTION: [18, 79, 47, 72]

PROBLEM: [[74, 38, -96], [91, 39], [2, 78, 37, -100, -142, -36, -182], [-121, -158, -2, -78, -87, 68, -185], [-128, -188, -111, -188], [2, -141], [7, 84], [-18, 81, 29, 62, -133], [-188, 17, -119, -160, -189, -46]]

SOLUTION:
[74, 91, 78, 68, -111, 2, 84, 81, 17]