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: [[-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: [[-35, -168], [73, -23, -44, -109], [-90, 58, -47, 56], [-27, -102, -149, -183, 72]]

SOLUTION: [-35, 73, 58, 72]

PROBLEM: [[-170, -147, 95, -135], [-150, 77, -85, -75, -117, -100], [-39, 95, 94, -105], [21, -89, -188], [-112, -159, 7, 81], [-192, 31, -167, -68, -186], [70, 100], [31, 21, -85, -166, 59, -144, -31], [-63, 33, -141, -86, 15, -140]]

SOLUTION:
[95, 77, 95, 21, 81, 31, 100, 59, 33]