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: [[99, -189, -117, -151, 99, -174, 87], [-164, 68, -7, -84, 43, -199], [-62, -198, -32]]

SOLUTION: [99, 68, -32]

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: [[-119, 19], [7, -192, -79, -165, -28], [62, -112, -174, -72, 74], [-136, 13, -200, -91, -104, -68], [13, 0, -94, -142], [0, -56, -191], [72, -80, 36], [-123, -38, 100, -92, -56, -168, -122], [19, 22, 58, 97]]

SOLUTION:
[19, 7, 74, 13, 13, 0, 72, 100, 97]