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: [[99, -189, -117, -151, 99, -174, 87], [-164, 68, -7, -84, 43, -199], [-62, -198, -32]]

SOLUTION: [99, 68, -32]

PROBLEM: [[-178, 31, -89, -67, 55, -105], [-18, 92, -9, 69, -95, 92], [-95, 45], [-127, 57], [41, -37, 33, 41], [-72, -74, -86, -183, 86, 31], [35, -121, -199], [-165, -69, 85, -172], [14, 85, -46, -140, 25]]

SOLUTION: [55, 92, 45, 57, 41, 86, 35, 85, 85]

PROBLEM: [[10, 12, -194, 73, -111, 14], [-48, -101, -25, -149], [67, 9, -118, -105, -145, -4], [30, -25, 5, 47, -82, -14], [-55, -155], [13, -87, -164, -182, -198], [-30, -164, -47]]

SOLUTION:
[73, -25, 67, 47, -55, 13, -30]