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: [[51, 10, -181, -96], [-40, 69, 46, -116, 53], [-135, 92], [-151, 35, -65, 52], [23, -125, 82, 57, -57], [-185, -94, -73, -131, -191, 70, -154], [9, 65, 41]]

SOLUTION: [51, 69, 92, 52, 82, 70, 65]

PROBLEM: [[-187, -137, -154], [-36, -31, -1, -81, 8], [71, -85, -87], [16, -91, 30], [-176, -77, 12, -100, -135]]

SOLUTION: [-137, 8, 71, 30, 12]

PROBLEM: [[-27, 96, -22, -191, -152], [-141, -173, -79, 49], [-8, 36, -75, -136, -27, 80], [-144, 21], [-37, 99], [-116, -48, 70, 69, 81], [97, -45]]

SOLUTION:
[96, 49, 80, 21, 99, 81, 97]