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: [[65, 72, -140, -53, -102, -66, -171], [36, -50], [-166, 32, 12, -43], [-129, 2, -49], [-172, -124, 44, -100, -133], [89, -95, 52, 45, -102, -4]]

SOLUTION: [72, 36, 32, 2, 44, 89]

PROBLEM: [[10, -182, -172, -154, 42, -42, -159], [10, -7, 32, -26], [-79, -77, -179], [57, 21, -139, -114, 23, -177, 24], [-122, 57, -110, 84], [42, -107, -190, -73, -184, -186]]

SOLUTION: [42, 32, -77, 57, 84, 42]

PROBLEM: [[-106, -125, -44, 96, -133, -132], [49, -31, 95, 93, -29, 82], [-173, -84, -164, -58], [-24, -134, -184], [-150, -40, 20, -18, 71, -33, 16], [16, 38]]

SOLUTION:
[96, 95, -58, -24, 71, 38]