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: [[-92, 66], [-124, -75, -170, -17, 20, -164]]

SOLUTION: [66, 20]

PROBLEM: [[-124, -174, -30, -67], [44, -156, -76, 68, -145, -19, -178], [-18, -104, -19, -63, -15], [-99, 12, -129, 38, 4]]

SOLUTION: [-30, 68, -15, 38]

PROBLEM: [[-57, -36], [56, -103, 77, 83, 57, -108, -54], [-11, -117, -38, 38, -169, -72, -197], [-138, -63, -100, 19, 87, -14], [-124, -173, -66, -126, -165, -173, 71], [-31, 54, -87, -147, 60, 62, -124]]

SOLUTION:
[-36, 83, 38, 87, 71, 62]