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: [[-94, -23, -131, -75], [94, 72, -29, -30, -63, 86], [42, -62, -33], [34, -167], [-197, 7, -89, -184, 96], [-75, -131, 2, -6, -111, 77, -36], [48, -32, -41, 73], [-178, 60, -5, 39, 40, -27], [-47, -192, -25, -122, -38, -100]]

SOLUTION: [-23, 94, 42, 34, 96, 77, 73, 60, -25]

PROBLEM: [[97, -63, -64, -183, 95, -144], [-60, 44, -72, 31, -170, 88], [-127, 4, 73, -124, -186], [59, -117, -13, -186], [9, 39], [-174, 92, 4, -67, -112], [78, -107], [48, -75, 13, -184, -140, -104]]

SOLUTION: [97, 88, 73, 59, 39, 92, 78, 48]

PROBLEM: [[23, -2], [-65, -120, 21], [-59, -109], [3, -181], [48, -175, -190, -186, -72], [-10, -55, -106, -103, -148]]

SOLUTION:
[23, 21, -59, 3, 48, -10]