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: [[62, 99, 64, 0, 34, -52, 11], [-53, 32, -147, 29, -84, -116]]

SOLUTION: [99, 32]

PROBLEM: [[-42, -152, -122, -79], [-85, 39, 36, -53], [83, 52], [-31, -2, -176, -152, -107, 44, 62], [10, -163, -16], [44, 33, 55, -59, 1, -30, -19]]

SOLUTION: [-42, 39, 83, 62, 10, 55]

PROBLEM: [[-187, 66, -30, -184, -161, -138, -155], [-164, -81, 94, 29, -138, -171], [-84, -3], [-109, -13, -104, -77, -21, -200], [-166, 44, -139, -71, -124, -44, -9], [36, -105, -42, -200, -129]]

SOLUTION:
[66, 94, -3, -13, 44, 36]