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: [[53, -34, -71, -43, -141, -174, -73], [5, -80, -181, -140, -63, -86, 34], [-86, -1, 91, 15, -191], [-171, 1, -62, 9, -161, 40, 35]]

SOLUTION: [53, 34, 91, 40]

PROBLEM: [[72, -19, -46, -126], [0, 47, 52, -113, -37, -16, -81], [82, -7, 2, 84, 38], [-178, -84, 84, 14, -123]]

SOLUTION: [72, 52, 84, 84]

PROBLEM: [[90, -94], [97, -110, 16], [-200, -79, 3, -22, 43], [-62, -76, 29, -18], [81, 66], [-113, 4, -125]]

SOLUTION:
[90, 97, 43, 29, 81, 4]