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: [[59, -66, -98, -64, -117, -128, -189], [-170, -12], [-25, -110]]

SOLUTION: [59, -12, -25]

PROBLEM: [[-15, 9, -181, -172, -74], [-164, -77, 1, -65, 29, -113, -163], [-189, -106, 22, -40, -50, -48], [-77, -61, 16, 85, 36, -45, -26], [2, 77, -77], [-146, -87, 75, -163, -147]]

SOLUTION: [9, 29, 22, 85, 77, 75]

PROBLEM: [[46, 17, -113], [12, -170, -113, 48, -55, -190, -109], [-92, 86, -199, 53, 60, -129, -38], [-114, 10, 9, 45], [-56, 45, -118, -3], [-30, 89, 84], [34, -130, -76, -136, -105, 46], [-121, 70, -163, -107], [72, -18, 6, 58, 96, -77]]

SOLUTION:
[46, 48, 86, 45, 45, 89, 46, 70, 96]