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.
--------
Question: [[-140, -111], [38, 51, -192, -25, 83, -196], [-191, -156, -8], [92, 40], [55, -157, -25, -158], [-51, -143, -144, -38, -82, 44, 91], [-179, -145, -39, 26, 70]]

Answer: [-111, 83, -8, 92, 55, 91, 70]


Question: [[50, -190, -70, -140, 92], [-120, -42, -110, -16, -197, 46, -152], [-180, 25, -91, -20], [19, -37, -186, -52, -171, -66]]

Answer: [92, 46, 25, 19]


Question: [[95, -82, -181, 70, -79, 89, 96], [40, -54, 85], [79, -150, -175, -108, -196, -157], [-28, -155, -104, -127, 23, -26, 50]]

Answer:
[96, 85, 79, 50]