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: [[-45, -1, -51], [-156, -12, -52, -85, -77, -21, -82], [-134, -82, -110, -168], [-118, -182, -74], [21, -44, 78]]

SOLUTION: [-1, -12, -82, -74, 78]

PROBLEM: [[-197, -160, 33, -161, 21, -115, -84], [34, -39, 11, -12], [-187, 68, -189, -24, -72, -19, -28], [-13, -17]]

SOLUTION: [33, 34, 68, -13]

PROBLEM: [[-161, 43, -70, 16], [71, 36, 58, -195, -136, -195], [-102, -149, 40, 96, -192], [5, 79, -126], [-2, -163], [-152, -80, -83]]

SOLUTION:
[43, 71, 96, 79, -2, -80]