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: [[-29, 35, -38, -160, -138], [-179, -69], [-171, -170, -136, -81], [78, -45, 92], [-6, 91, -167, -63, -193, 69], [58, 42], [-152, -58, -89, -148, 48], [-81, -41, -193, -127]]

SOLUTION: [35, -69, -81, 92, 91, 58, 48, -41]

PROBLEM: [[-184, -93, -128, -153], [50, -104], [21, -156, -185, 27, 32, -187, -132]]

SOLUTION: [-93, 50, 32]

PROBLEM: [[29, 4, 54], [-91, -156, 17, 11, -21], [-86, -14, 46, -10, -162, -133], [84, 95, -9, -16], [22, -85, -133, -35, -101, 40, 46], [-63, -44, -163, -169], [-112, -182, -146], [-72, -55], [-110, -87, -28, -125, 50]]

SOLUTION:
[54, 17, 46, 95, 46, -44, -112, -55, 50]