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: [[-31, -113, -173, -37, -4, -189, -191], [-32, 92, -46]]

SOLUTION: [-4, 92]

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: [[88, 13, -118], [64, -193, -60, 17, 58], [-182, -98], [-102, -133], [-57, 4, 68, -182, -49, -149], [-181, 27, 65], [-71, -148, -190, -30]]

SOLUTION:
[88, 64, -98, -102, 68, 65, -30]