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, 27, -29, 53, -93], [-148, -197]]

SOLUTION: [53, -148]

PROBLEM: [[65, -176], [77, 97, -198, -72, -92, 10], [-147, 17], [-49, 33], [-49, -27, -78, -184, -94, -146, 14], [-193, -145, -81, -38, -161]]

SOLUTION: [65, 97, 17, 33, 14, -38]

PROBLEM: [[70, 74], [-70, 98, -102, -56], [-55, -165, -178, -32, 71, -72, -81], [-10, 50, -113, -140, -77, -103]]

SOLUTION:
[74, 98, 71, 50]