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: [[-134, -48, 4, 24, 71, -187, -166], [44, 10, 44, -55], [-63, -29, 15, -89, 78, 63, -106], [-112, -11, -134, 87, -46], [-128, -93, 68, -87], [-147, -63, 91]]

SOLUTION: [71, 44, 78, 87, 68, 91]

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: [[90, 43, 66, -119], [9, -78, 22, 6], [78, -152, 9], [94, -167], [-41, -129, -74, 12, -178, -3], [-132, -166, 10, -131, -24, -136, -19], [-59, -51, -66, -33], [-129, -35, -44], [-146, 3, 2, -57]]

SOLUTION:
[90, 22, 78, 94, 12, 10, -33, -35, 3]