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: [[-96, 57, -186, 28, -171], [80, 54], [-20, -187], [-50, -169], [-13, 8, -129, -76, -46], [-119, 64, -170]]

SOLUTION: [57, 80, -20, -50, 8, 64]

PROBLEM: [[41, -199, -65, -168, -36, 58, -56], [-77, -129, 54, -46, 54, -38, -171], [-163, 100, -20, -74, -64], [50, 65, -124, -61, -167, 53, 38]]

SOLUTION: [58, 54, 100, 65]

PROBLEM: [[76, -68, -68], [46, -123, 40, -28, -142, -7], [-151, -180, -152, -97, -199], [75, 98, -100, -101], [-8, 72, -161, -100, -171, -9, -197], [37, 22, -194, -71, 29, -50], [-181, -133, -45, -123, -56, 55, -111], [60, -135, -50, 10, -125]]

SOLUTION:
[76, 46, -97, 98, 72, 37, 55, 60]