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: [[-191, 34, -39, -8, 47, 13], [-94, -33, -196, -199, 28, -149, 58], [35, 97, 98, 95, -133, 99, -101], [-190, -57], [-138, -149, 1, -168, 92, -195, 3], [-77, -100], [-130, 2, 30], [0, -177], [-38, -131]]

SOLUTION: [47, 58, 99, -57, 92, -77, 30, 0, -38]

PROBLEM: [[42, -42, -94, 25, -125], [-141, -138, -170, -87, -121]]

SOLUTION: [42, -87]

PROBLEM: [[73, 71, -32, -159, 1, -193], [-66, -47, -184, 78, 62], [-164, -162, -37, -199, -167, 63, -163]]

SOLUTION:
[73, 78, 63]