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: [[-13, -42, 79], [10, -6, 24, -174, -92], [65, 8, -120, -166, 36], [-181, 25, -196, -180, -44], [-38, 72, 84]]

SOLUTION: [79, 24, 65, 25, 84]

PROBLEM: [[-197, 92], [-60, 20, 76, -120], [-176, -16, 98, -37, 29, -15], [-116, 91, 4, -87, 25, -4], [-85, 83, -187], [-91, 53, -49, -88, -180, -15, -147], [-38, 17]]

SOLUTION:
[92, 76, 98, 91, 83, 53, 17]