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: [[77, 52], [-25, -37, 13, 77, 88, -15, -158], [60, 86, -7], [78, 7, -132], [99, -94, -185, -158], [34, -90, 83, -81], [-21, -63, -161, 47, 12, 95], [59, 29], [-45, -57, 96, -170, 76, -70]]

SOLUTION: [77, 88, 86, 78, 99, 83, 95, 59, 96]

PROBLEM: [[-196, 52], [80, -113], [98, -17, -86, -188, -30], [38, -90, -68], [-171, 69, 27, -179, -177], [-193, 6, -95, 81, -128, -85, -91], [-117, -25, 8], [-71, -75, 64, -111]]

SOLUTION: [52, 80, 98, 38, 69, 81, 8, 64]

PROBLEM: [[-80, 52], [26, -56, 52, -11, 47, -14], [-75, -33, -185], [-169, 20, -99], [-186, -116]]

SOLUTION:
[52, 52, -33, 20, -116]