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: [[-67, 92, 59, -49, -22, -8], [-65, 28, -120, -118, -63, -19, -160], [10, 46, -37, 65, -184, 99, 52], [-18, 15, 6]]

SOLUTION: [92, 28, 99, 15]

PROBLEM: [[-198, -153, -19, -72, 28, 29, -90], [63, -74, -59, -20, -46, -49, -27], [-67, -86, -184, 12, -79], [34, -140]]

SOLUTION: [29, 63, 12, 34]

PROBLEM: [[-110, 32, -85, -141, -1], [97, -23, -21, -78], [-110, -179]]

SOLUTION:
[32, 97, -110]