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: [[-190, -118, 52], [-118, -139, -176, 7, -164, -105, 8], [23, -133], [-158, 54, -118, -120], [-162, -147], [-154, -102, -134, -142, -141, -127, 61], [25, 7], [-151, -160, -44], [92, -66, -39, -131, -53, -166, 30]]

SOLUTION: [52, 8, 23, 54, -147, 61, 25, -44, 92]

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

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

PROBLEM: [[48, 75], [-67, -70], [33, 22, -77, -158, 80], [-103, -61, 51, -174, -63], [-22, -85], [54, -48, -192, -179, -115, -98], [-35, -133, -198, 11, -7, -182], [-62, 73, -93]]

SOLUTION:
[75, -67, 80, 51, -22, 54, 11, 73]