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: [[-164, -163], [1, 37, -165, -60, -180, -193], [-29, -183, 98, -95, -45, -69, 14], [-25, 2, -78, -148, 77, -199, -52], [34, 58, -118, -127, 37, -123], [-113, 47, 28, -199, 25, -31, -197]]

SOLUTION: [-163, 37, 98, 77, 58, 47]

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: [[49, -53, -184, 61, -96, -62], [-58, -49, -70, -190]]

SOLUTION:
[61, -49]