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: [[82, -5, -106, 4], [92, -200, -78], [-93, -181, 63, 63], [15, -137, 27, -139], [-155, -26, -164, -24], [-98, -91, -127], [-127, -21, 47, 19, -190, 44]]

SOLUTION: [82, 92, 63, 27, -24, -91, 47]

PROBLEM: [[61, -35, -161], [-87, 73], [-82, 78, -19, -170], [-169, -132, 71], [-99, -136, -127], [88, -173, 0, 74, -8, 73], [-111, -164, -30]]

SOLUTION: [61, 73, 78, 71, -99, 88, -30]

PROBLEM: [[12, -35, -32], [-26, -56, -100], [-164, 71, -117]]

SOLUTION:
[12, -26, 71]