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: [[-191, 15, 11, -122, -8, -77, 51], [82, 28]]

SOLUTION: [51, 82]

PROBLEM: [[-64, -150, 1, 7, -71, -89, 54], [44, 34, -40], [40, -184, 50, -161, 38, -108], [-178, -136, -170, -59, -71, 12], [-80, -60, 24, -169, -1], [-145, -28, -63]]

SOLUTION: [54, 44, 50, 12, 24, -28]

PROBLEM: [[-90, -74, 63, -8, -83, -94, 57], [0, -161, -95, -72], [-95, -49, -35, 51, -65], [-167, -127, 5, -197, 9, -44]]

SOLUTION:
[63, 0, 51, 9]