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: [[-79, -105, 14, 41, -10, 26], [-96, -44, -191], [19, 34], [-56, -50, -39, -94, 79, 86], [-137, -145, -74, 26, -54, -172]]

SOLUTION: [41, -44, 34, 86, 26]

PROBLEM: [[-19, -31, -126], [-24, -137, -129], [-126, 93, -32, 79, -145, -152], [-200, -55], [-194, 52, -67, -77, 15, -186, -158], [92, 62, -44, 90, -168, 96, -193], [-22, -125]]

SOLUTION:
[-19, -24, 93, -55, 52, 96, -22]