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: [[-181, -180, 67, -144, 81], [-111, -185, -90, -148], [-57, 8, -160, -124, -144], [-127, 69, -3, -93, -101], [57, -173, 91, -38], [-75, -50, 8, 83]]

SOLUTION: [81, -90, 8, 69, 91, 83]

PROBLEM: [[-117, -110, 36, 18], [-15, 40, -140], [-33, 79, 8, 42, -4, 84]]

SOLUTION: [36, 40, 84]

PROBLEM: [[-155, -34, -36, -145, -193, 59], [-86, -145, -168, 9, -91], [-80, 54]]

SOLUTION:
[59, 9, 54]