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: [[-153, -42, -80], [4, 30], [87, -57, -137, -85, -188, -158], [-89, -68, -173, 34]]

SOLUTION: [-42, 30, 87, 34]

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: [[16, 80, 2, -184, -130, -165], [-112, -61, -27, -67, 15, -85], [-151, 71, -125, -164], [-98, -85, -37, -182, 21, -135, 13], [1, -98, -24, -171], [-76, -172, -152, -116, 2, 74, -118], [33, 25], [-92, -30, 18, 6, -55, 10, -191]]

SOLUTION:
[80, 15, 71, 21, 1, 74, 33, 18]