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: [[-181, -160, -10, -6, -128], [78, -145, -191, -36]]

SOLUTION: [-6, 78]

PROBLEM: [[-54, -50, -198, 12, -192, -172, -144], [-126, 88], [-37, -197, -49, -177], [-187, 83], [65, -32, -176, -162]]

SOLUTION:
[12, 88, -37, 83, 65]