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: [[-106, 10, 60], [-32, -143], [-139, -187, -193, 68], [40, -29, 93, -179, -66, -190, 24], [24, -72], [-111, -130, -98, -114, -138, -87, 26], [-54, -151, 7], [20, -64, 85]]

SOLUTION: [60, -32, 68, 93, 24, 26, 7, 85]

PROBLEM: [[15, 99], [1, -154], [-57, -131, 16, -66, -17, -102, -159], [-106, -170, -134, -142, -1, 19], [-103, -119, -123, -127, 62]]

SOLUTION: [99, 1, 16, 19, 62]

PROBLEM: [[-132, -111, 11, 72, 30, 48, -106], [-51, 53, -22, -137]]

SOLUTION:
[72, 53]