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: [[-95, 64, 33, -57, -71], [55, -167], [92, -43, -108, -43, -100, -134], [95, -6, 0, 17, -162, -188], [9, 59, 56, 72, -140], [-155, -158, -66, -29], [63, -183]]

SOLUTION: [64, 55, 92, 95, 72, -29, 63]

PROBLEM: [[-187, -137, -154], [-36, -31, -1, -81, 8], [71, -85, -87], [16, -91, 30], [-176, -77, 12, -100, -135]]

SOLUTION: [-137, 8, 71, 30, 12]

PROBLEM: [[32, 62], [37, -160, -25, -90, -129, 11], [-177, -123], [62, -97, -126, -2, 6, -58], [-172, -195, -170, -38, -85, 83], [8, -97], [-13, -92, -18, -47], [-105, -53, 79, -65, -57, 34], [-138, -184, -90]]

SOLUTION:
[62, 37, -123, 62, 83, 8, -13, 79, -90]