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: [[37, -149, 70, -32, -45, -159], [-144, -48], [-19, -130, -128, -154, -55, -183, -44]]

SOLUTION: [70, -48, -19]

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: [[-155, 50], [-144, 59, 5, 13, 67, 24, -198], [-24, -153, -138], [66, -146], [34, -10, -24, 95, -157, 46]]

SOLUTION:
[50, 67, -24, 66, 95]