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, -34, -73, 46, 51, -185, -192], [-43, -56, -90, -52], [59, 91], [90, 18, 33, -33, -62, -52]]

SOLUTION: [95, -43, 91, 90]

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: [[82, -155, 48, -95], [-123, 80, 6, -116, -59, -134], [27, -146, 71, -31, -116], [-174, -81, -171, -132, -100], [-24, -17, -124, 65], [-106, 82, -86]]

SOLUTION:
[82, 80, 71, -81, 65, 82]