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: [[58, -59, 67, 49, -141, -53], [90, -175, -119, -145, -172, 72, -40]]

SOLUTION: [67, 90]

PROBLEM: [[-164, 46, -40, 79, -196], [-5, 88, -93, 31, -195, 67], [-68, -147, -199, 93], [-77, -196, 74, -107, 89], [32, -122, 10, -116, -112], [-134, -113, 40, -68, -86]]

SOLUTION: [79, 88, 93, 89, 32, 40]

PROBLEM: [[-180, 78, -36, 38, -113], [4, -190, -178, -127, -68, 64], [-103, 95], [-181, -194, -129, -10, 1, -56], [-118, -139, 53], [-172, -131, -157, 53, 71, -100, -100], [-96, 88, 76, -92], [-86, 32, -28]]

SOLUTION:
[78, 64, 95, 1, 53, 71, 88, 32]