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: [[20, 71, -57, -136, 45], [-3, -147, -182], [48, -161, 35, -16, -193], [7, 90, -78, -102], [-108, 92, 30, -147, -86, -132]]

Answer: [71, -3, 48, 90, 92]


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: [[-15, -52, -54, -19, -180, -133], [-63, 20], [-69, -101, 22, -131, 75, 85, 69], [-127, -106, -68, 14]]

Answer:
[-15, 20, 85, 14]