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: [[5, 20], [36, -36, -177, -145], [90, -26, -6, 12, 94]]

SOLUTION: [20, 36, 94]

PROBLEM: [[-76, -194, 15, 74], [-60, -20, 6], [-118, -40, 82], [-135, 13], [10, -24, -119, -62, -109], [0, 5]]

SOLUTION: [74, 6, 82, 13, 10, 5]

PROBLEM: [[-81, -142, 98, -26, 22], [4, -56, -69, -77], [32, -56, -190, -158, -154, 73, -35], [19, -58, -88, 0, -162, -45], [-84, 19, -106, -183], [-174, 26, -160, 41], [-160, 92, 18, -182]]

SOLUTION:
[98, 4, 73, 19, 19, 41, 92]