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: [[91, -82, -158, -188], [-148, -168, 25, 53], [-87, 82], [-176, -136, -24, -72, -9, -12]]

SOLUTION: [91, 53, 82, -9]

PROBLEM: [[-155, -167, -150, 0], [16, -57, -93, -128, -43, -97, 22], [17, -179, -11, 15], [-77, -129, 48, -163, -66], [-52, 31, -142, 80, 48, -15]]

SOLUTION: [0, 22, 17, 48, 80]

PROBLEM: [[-3, 63, -83, -81, -152, -37, 40], [57, -24, -160, -3, 25, 71]]

SOLUTION:
[63, 71]