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: [[34, -28, -82, 73, -107, -173], [-23, -123, -142, 26, -22, -200, -131], [-142, -55, -194, 81, -194, -19, -19], [-53, -97, 48, -30, -189, -9, -22], [-117, 31, -8, -83], [25, -11], [34, -163, -82, 44, -43, 16], [-124, -84, 31, 10, 30]]

SOLUTION: [73, 26, 81, 48, 31, 25, 44, 31]

PROBLEM: [[-88, 24], [-125, -39], [95, -76, -84, -69, -190, -148], [-196, 71, -2, -91, -112]]

SOLUTION: [24, -39, 95, 71]

PROBLEM: [[-3, 18, 19, -147, 9, -106, -42], [50, -155], [-165, -88, 6, -21, 15, -68, -21], [90, -146, 21, -41, 38]]

SOLUTION:
[19, 50, 15, 90]