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: [[-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: [[-138, 71, -27, -83], [-80, -136, 28, 70], [33, -23, -79, -51, -127]]

SOLUTION: [71, 70, 33]

PROBLEM: [[89, -156, -74, -74, 87, -79], [44, 86, 38, 45, -149, -165], [29, 4, -72]]

SOLUTION:
[89, 86, 29]