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: [[-22, -69, -38, -9, -92, 36], [-169, -140, -163, 86], [10, -73, -36], [-124, 53, 81, -61, 65, -184, -170], [69, -177, -73], [-112, 41, -38], [91, 31, 85, -72, -93, -48, 66], [-73, -180, 34, 16, -175, -28]]

Answer: [36, 86, 10, 81, 69, 41, 91, 34]


Question: [[-99, -20, 1, -195], [47, -92, -16, 34, -113, 62, 3], [-200, -20, -92, 100], [-27, -94, 26, -53, -67], [-73, -16, -70, 12, 85, -173, -193], [-183, -64, -9, 56, -73, -21, -76], [-69, -9, -193, -108, -97]]

Answer: [1, 62, 100, 26, 85, 56, -9]


Question: [[-9, -33, 69, 47, 42], [-10, -28, -19, -142, -153, -181, -141], [9, -164, -160, -154], [-186, 50, 8, -72], [-122, -141], [11, 5, 19, -57, 65, 49, -96], [-86, -113, -169], [-161, 12, -65, -164, -177, -130], [-28, -78, -198]]

Answer:
[69, -10, 9, 50, -122, 65, -86, 12, -28]