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: [[72, -172, -132, 93], [-200, -74, -56, -40, -68, -163, -58], [-72, -164], [-166, -70, -127, -16, -41, -121, 13], [-56, 91], [-181, 35, -12, -99, -122], [-66, 33], [18, -141, -40, 28, -175, -102, -63]]

SOLUTION: [93, -40, -72, 13, 91, 35, 33, 28]

PROBLEM: [[-191, 84, -188], [58, -44, -167, -105, 37], [-92, -44, 3, 23, 26, 37], [-107, -65, 55, 81], [-32, 58], [31, -25, -80, -152, -111, -154, -147], [-166, -135]]

SOLUTION: [84, 58, 37, 81, 58, 31, -135]

PROBLEM: [[-159, 2, -48, 91, -33, -46, 97], [-99, 94, -105, 5, 31], [-67, 94, -81], [-196, 53, 18, -73], [-189, -90]]

SOLUTION:
[97, 94, 94, 53, -90]