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: [[78, 3, -186, -60, -85, -7], [-3, -75, -30], [63, -19, -166], [-47, -88, 58], [-94, -36, -79], [-134, -2, 43, 87]]

SOLUTION: [78, -3, 63, 58, -36, 87]

PROBLEM: [[-187, -150, -33], [-15, 40, -23, -77, -8, 49], [-40, 11, 37], [-136, -34], [25, 64, 77, 92, -190], [-43, -9, 57, -11, -185, -188, -127], [-58, 19, -27, -64], [51, -46, -19, 72], [-92, -199]]

SOLUTION: [-33, 49, 37, -34, 92, 57, 19, 72, -92]

PROBLEM: [[-192, 42, -72, 85], [61, -82, -81, -169], [-80, -199, -184, -97, 75, 92], [66, -141, 55], [81, -115, -142, 9, -12], [-179, -119, -92, 19], [-6, 52, 11, -16, 67, -172], [-96, -25, -179, -40], [-23, -123, 58, -195, -194, -66, -165]]

SOLUTION:
[85, 61, 92, 66, 81, 19, 67, -25, 58]