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: [[57, -140, -88, -200, -81, 0], [-17, -81], [-64, -151, -32, -36, 58, 27, -86], [-142, -121, -92, 0, 53, -73], [-21, 51, -25], [63, 88, 25, 10], [-95, -148, 25, -161, -168, -76], [2, -111, -15, -79, 61], [-44, 12, -135, -7, 73, -84, -144]]

SOLUTION: [57, -17, 58, 53, 51, 88, 25, 61, 73]

PROBLEM: [[70, -121, -154, -99, 76, 89, -99], [-154, -54, 50, 13, -171, 20, -71], [-25, -171, -40, -54], [-181, -156, 50, 98, -56, 95, -200], [-38, 4, 29, -10, -177, -58], [-66, 25, 28, -160, -94], [42, 3, -14, -129]]

SOLUTION:
[89, 50, -25, 98, 29, 28, 42]