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: [[52, -72], [-90, -59, -53, -180], [13, -64, -153], [-149, -38, 7, 61, 93, 1]]

SOLUTION: [52, -53, 13, 93]

PROBLEM: [[97, 4, -169, -58, 19], [-124, -24, 25, -83, -178], [-20, 45], [-181, 51], [-124, -113, -154, -181, -175], [-150, -93, -196, -56], [-69, 41], [-171, -40], [74, 19, -17]]

SOLUTION: [97, 25, 45, 51, -113, -56, 41, -40, 74]

PROBLEM: [[-174, 29, -133], [76, 65], [67, 63, -189, -103], [6, -6, -14, -193, -4, -13, -78], [-96, -187], [54, -72, 62, 95, 25]]

SOLUTION:
[29, 76, 67, 6, -96, 95]