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: [[-150, -68, 94, -20, -105], [-115, -107, -200, -174], [43, -27, -166, -123, 34, -161, -73]]

SOLUTION: [94, -107, 43]

PROBLEM: [[-61, 31, -135, 15, -167, 30], [-1, -18], [65, 41, -43, -165, -28, -135], [-15, -117], [-38, -151], [12, 59, -5, -79, -104, -109, -93], [-66, -61, -171, -23]]

SOLUTION: [31, -1, 65, -15, -38, 59, -23]

PROBLEM: [[13, -115, -172, -91], [-53, -200, -164, -168], [-156, -50, -12, -17, 21], [62, -190], [14, 23, -26, -71, 62, 88], [-91, -197, 71, 67, 45, 75], [-179, -159, -57, 87, -106]]

SOLUTION:
[13, -53, 21, 62, 88, 75, 87]