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: [[-16, -4, -100, -51, 2], [32, 53, 72, -32, 24], [6, 60, -111, -198, -123]]

SOLUTION: [2, 72, 60]

PROBLEM: [[-26, -102, -136], [-24, 31], [-27, -127, -134, -71], [94, -98], [-150, -182, 69, 59], [47, -49, -92], [-155, 55, -81, -194], [-8, -35]]

SOLUTION: [-26, 31, -27, 94, 69, 47, 55, -8]

PROBLEM: [[-75, -103], [13, -7, -126, -114, -192], [-176, 3, -69, -159, 68, -130], [-148, -54, -176, 59], [-138, -87], [63, 65, 97, -188, -55, 60, -119], [56, -72, -102], [-96, -43, -77, 3], [-64, -115]]

SOLUTION:
[-75, 13, 68, 59, -87, 97, 56, 3, -64]