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: [[-170, -186, -15], [-130, -93, -50, 88, -170], [-15, -144, -141], [-85, -104, -115]]

SOLUTION: [-15, 88, -15, -85]

PROBLEM: [[-116, -68, 24, -71, 28], [70, 38, 69, 30, -74], [-97, 52], [-110, -129, 63, 50, 44, -11], [-190, -145], [-176, 11, -35]]

SOLUTION: [28, 70, 52, 63, -145, 11]

PROBLEM: [[-170, -178, 80, 58, -146], [-53, -124], [28, -12, -60, -20, -70, 13]]

SOLUTION:
[80, -53, 28]