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: [[-161, -49, -6], [36, -84], [-53, 29, 2, -167, -111], [-163, -46], [-41, -91], [-71, 29, 35, -187, -53, -196, -66]]

SOLUTION: [-6, 36, 29, -46, -41, 35]

PROBLEM: [[32, -174, -116, -146, -74, 87, -87], [-102, -165, 7, -84, -82], [73, -170, -66], [-110, 69, -136, 39, -1, 1, -145], [-8, -27, -66, 44, 71, 96, -193], [-106, -134], [5, 26, 26, 48, -103], [-35, -137, -99, -117, 84]]

SOLUTION: [87, 7, 73, 69, 96, -106, 48, 84]

PROBLEM: [[70, -90, -111, 45, -77], [74, -177, -84, -153, -133], [44, 21, -152, 37, -69, -169, 30], [-195, 49, -56, -77, -135, 53]]

SOLUTION:
[70, 74, 44, 53]