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: [[95, 39, -13, -74, -49, -40, 31], [57, -5, 12, -24, 50, 50, 14], [-195, -144], [-90, 66], [-151, -149, -117, 54, 41, -168], [-67, 52, -41, -156, 24, 37], [-48, 20, 93, -94, -152], [-80, -95, 100, -95], [-178, 21]]

SOLUTION: [95, 57, -144, 66, 54, 52, 93, 100, 21]

PROBLEM: [[93, 55, 18, 28, -87, -59], [-181, 6, -163, -78, 17], [70, -41, 36, 78, 67, -180], [-180, 84, 59], [-155, 35]]

SOLUTION: [93, 17, 78, 84, 35]

PROBLEM: [[53, -54, 41, 11], [-118, -162, 65, 96, 74], [-163, -160, -197, -193, -12], [-104, -23, -55, 41, -151, 77], [-191, -9, -90], [-136, -47, 62, -74, -24, -20, -47]]

SOLUTION:
[53, 96, -12, 77, -9, 62]