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: [[60, -121, -47, -34, -99], [-172, 26], [-87, 61, -54, 39], [-150, 74, -19, -90, 53], [-116, -189, -28, -36]]

SOLUTION: [60, 26, 61, 74, -28]

PROBLEM: [[91, -30, -165, -83, -18, 16], [-187, -77, -17, -151, -93, -151], [-135, -172, 18, 64, -60, 7, -119], [-189, 38, 81, 6, -68, -147, -36], [54, -171], [-139, 100, 28, -55, 52, 21, 82]]

SOLUTION: [91, -17, 64, 81, 54, 100]

PROBLEM: [[-54, -91, -146], [8, -118, -123, -155, -61, -123, -133], [89, 79, -186, -130, 67], [-187, -47, -156, -68, 59, -39, -198], [53, 5, -99], [20, -136, 24, -31, -149, -14], [-43, -40], [-62, -79, 44, 47, -190, -156]]

SOLUTION:
[-54, 8, 89, 59, 53, 24, -40, 47]