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: [[18, -24, 22, -153, 38], [34, 6, -5, 98, -168], [-137, -175, -142, 39, 10, -54, -95], [-127, -48, -200, 24], [-166, -170, -38, -121], [-60, 1]]

SOLUTION: [38, 98, 39, 24, -38, 1]

PROBLEM: [[5, 20], [36, -36, -177, -145], [90, -26, -6, 12, 94]]

SOLUTION: [20, 36, 94]

PROBLEM: [[-168, 74, -86, 15, 36, -84], [-44, 79, 17, 61], [-112, 47, 55, -164, -153], [73, -185], [-144, -21], [25, 81, -13, -15, -117], [40, 16, -130, -83, 24], [-148, -177]]

SOLUTION:
[74, 79, 55, 73, -21, 81, 40, -148]