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: [[61, -157, 48], [29, 77, -102, -122, 50, 25, -186], [44, -84, -172, -97, -142], [-194, 62, -5, -145, 93]]

SOLUTION: [61, 77, 44, 93]

PROBLEM: [[-54, -80, 72, -155], [-182, 65]]

SOLUTION: [72, 65]

PROBLEM: [[-44, -68, 31, -143, -143, -158], [-62, 39, -113, -99, -169, 30, -178], [-163, 70, -91], [-159, -120, -178, -137], [21, 61, 99, -92, -36], [-122, -61, -159, -117]]

SOLUTION:
[31, 39, 70, -120, 99, -61]