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: [[-46, 14, -141, -77, -62], [-183, -86, -115], [-146, -60, 34], [-42, 19, -101, -49, 47], [-117, -174]]

SOLUTION: [14, -86, 34, 47, -117]

PROBLEM: [[-180, -199, -58, -43, -127], [53, -164, 83, -89, 55], [-96, -27, 59, -61, -183], [51, 91, 84, -46, -9, 30, -98], [-98, -4, -62, 2, -3, 69, 64], [54, 26, -25], [-26, -57, -76, -50, -169, -62]]

SOLUTION:
[-43, 83, 59, 91, 69, 54, -26]