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: [[-85, -197, 23, -152], [-86, 62, 72, -58, 33], [-117, 76], [-195, -177, -170, 97], [30, 79, -50, 72, 54], [-23, 49, -16, -188], [32, 5], [-109, -31]]

SOLUTION: [23, 72, 76, 97, 79, 49, 32, -31]

PROBLEM: [[-199, 11, -198, 9, -12, -184, 55], [-71, 17, -44, 64], [-144, -165, 40, 56, -179], [-151, -162, -94, -31], [-58, -4, -47, -69, -6, -168, -24], [51, -144]]

SOLUTION: [55, 64, 56, -31, -4, 51]

PROBLEM: [[-15, -50, -49, -130, -125, -90], [-41, -188, -79, 65], [50, 37, 94, -169, 48, -18, -78], [39, -147, -92, -73], [73, -94], [-139, -48, -52, -25, -198, -20], [56, -60, -72], [64, -61, 73, -4]]

SOLUTION:
[-15, 65, 94, 39, 73, -20, 56, 73]