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: [[-19, -151], [33, 54, 85]]

SOLUTION: [-19, 85]

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: [[-46, -112, -5], [30, -105, -192, 50, 90, 24, 41], [26, -196, 82, 78], [42, -148, -198, 12, 39], [-78, -113, 27, -32, -109, -73, -165], [1, -176, -158], [8, -42, -182, 33, -135]]

SOLUTION:
[-5, 90, 82, 42, 27, 1, 33]