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: [[-45, -1, -51], [-156, -12, -52, -85, -77, -21, -82], [-134, -82, -110, -168], [-118, -182, -74], [21, -44, 78]]

SOLUTION: [-1, -12, -82, -74, 78]

PROBLEM: [[-42, -87], [-101, -39, -128, 73, -16], [85, -168], [-166, -107, -135, -139, -35, 76]]

SOLUTION: [-42, 73, 85, 76]

PROBLEM: [[-154, -153, -41, -144, -62, -150], [-178, -50], [100, 17, -18], [-126, -83], [20, -149], [-12, -109], [100, -8, -15]]

SOLUTION:
[-41, -50, 100, -83, 20, -12, 100]