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: [[60, -121, -47, -34, -99], [-172, 26], [-87, 61, -54, 39], [-150, 74, -19, -90, 53], [-116, -189, -28, -36]]

SOLUTION: [60, 26, 61, 74, -28]

PROBLEM: [[79, -165], [-194, 6, 83, -87, -88, -184, -92], [-179, 2, -143, -1, -42, -195, 25], [-49, 75, -89, -5], [-107, 97, -50, -13, 98], [14, 76, -55, 3, 28, 8, 92], [-50, 84, 52, -149, -27, 31], [92, 82, 17], [-155, -74, 28, 9, 5, -101, -121]]

SOLUTION: [79, 83, 25, 75, 98, 92, 84, 92, 28]

PROBLEM: [[-175, 90, -50, -28, -192, -164, -110], [-124, 68, 51, -20, -165], [-114, 52, -141, 69, -121, -18], [61, -103, -12, -55], [93, 79, 23, -164, -167], [-200, -13, -148, -22, -135, -4, -156], [86, 35, 5, -33]]

SOLUTION:
[90, 68, 69, 61, 93, -4, 86]