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: [[73, -86, -24, -107, 43], [-26, -60, -75, -9, -165], [-134, 87, 97], [100, -87, -94, -163, -189, 87, 85]]

SOLUTION: [73, -9, 97, 100]

PROBLEM: [[-198, -161], [66, 7, 92, 36, -103, -44], [-121, 33, 33, -183, 81, -87, 6], [-125, 1, -186]]

SOLUTION: [-161, 92, 81, 1]

PROBLEM: [[58, -81, 65, 33, -49, -175], [-37, 45, -99], [-131, -43, -134, 25], [49, -190, 53, 35]]

SOLUTION:
[65, 45, 25, 53]