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: [[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: [[50, -190, -70, -140, 92], [-120, -42, -110, -16, -197, 46, -152], [-180, 25, -91, -20], [19, -37, -186, -52, -171, -66]]

SOLUTION: [92, 46, 25, 19]

PROBLEM: [[79, -14, -88, 97, 24, -39, -105], [68, -64, -123, -103, -38, 19, -63], [-184, -46], [73, -123, -9, 58, -61, -81], [-15, -122, -104, -200, 30, -150, -182], [-38, 45, -22, 42, -169, -13, 71], [-87, 28, -35, -17, 72, -36, -178]]

SOLUTION:
[97, 68, -46, 73, 30, 71, 72]