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: [[-195, 93, 71, -124, 21, -20, 92], [-58, -185, 7, -57, -20, -64], [-19, -117, 60, -165, 31]]

Answer: [93, 7, 60]


Question: [[-129, 67, 1, -129], [-35, -169, 26], [-125, 7, -53, -56], [-138, -51, -77, -16], [-139, -98, 78, 41], [-74, 46, 11, 79, -176, -89, -109], [4, -21, -101, -105, -99], [85, -182], [-105, 9, -122, -38, 35]]

Answer: [67, 26, 7, -16, 78, 79, 4, 85, 35]


Question: [[-55, -67, -7, -33], [23, -46], [-149, 93, -145], [-110, -3, -141, 54, -192], [-134, -43, 65, -72, -88, -135, 57], [-98, 10, 9, 73, -137], [-168, 94], [-188, -89, -14, -148, 45, -15]]

Answer:
[-7, 23, 93, 54, 65, 73, 94, 45]