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: [[89, -123], [-133, -92, -92, -101, 47], [19, 8, -116, -70], [-97, -36, -123]]

SOLUTION: [89, 47, 19, -36]

PROBLEM: [[-35, -72, -53, -9, 95, 58, -108], [-185, 72, -32, -90], [-117, -124, -172, 52, -37, -183], [-160, -193, -149, 25, -2], [-132, -182, -85], [-69, 39, -167, 57, -132, 13, 43]]

SOLUTION: [95, 72, 52, 25, -85, 57]

PROBLEM: [[-106, -142, -200, 24], [-119, -124, -124, 11], [-196, -178, 95, -86, 58, -150], [-194, 99, 34, 40, 76, 55, 50]]

SOLUTION:
[24, 11, 95, 99]