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: [[-170, -186, -15], [-130, -93, -50, 88, -170], [-15, -144, -141], [-85, -104, -115]]

SOLUTION: [-15, 88, -15, -85]

PROBLEM: [[-82, 59, 16, -170, -136, 39], [-40, -166, -55, 98, 96], [87, 75, 43, 27, -133], [-70, -62, 32, 79, -66, -138, 43]]

SOLUTION: [59, 98, 87, 79]

PROBLEM: [[-193, 56, -99, 93, 26, -66], [43, 82, 59, -33, -35], [-57, -70, -97, -87, -147, -163, -43], [-11, -84]]

SOLUTION:
[93, 82, -43, -11]