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: [[42, -42, -94, 25, -125], [-141, -138, -170, -87, -121]]

SOLUTION: [42, -87]

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: [[88, -62, 42, -194, 44, 2], [-76, -128, -15, 38], [-153, 44, -4, -19, -122, 25, -82], [88, 79, 8, 85, 64, -10], [49, -80, -61, -37, -199, -114, -164], [-68, -177, -3, -24]]

SOLUTION:
[88, 38, 44, 88, 49, -3]