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: [[-27, -28, 59, -2, -90, 50, -81], [9, 83, -62, 32]]

SOLUTION: [59, 83]

PROBLEM: [[-42, -149, -6, -115, -152], [-59, -75], [-178, -94, 49, -51, 52], [-51, 7, -146, -101, -191, 14], [-132, -103, 96, -126, -195, 80], [37, 19, -145, -23, -109], [-109, -125, 47, 36, 6, -123, 62]]

SOLUTION: [-6, -59, 52, 14, 96, 37, 62]

PROBLEM: [[-199, -196, -76, -47, -162, 84, -28], [-144, -112, -181, 3, -87], [-108, -123, 98], [-72, -113, -151], [-135, 14, -168, -122, 100, -101, 56], [-197, 32, -131], [-200, -169]]

SOLUTION:
[84, 3, 98, -72, 100, 32, -169]