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: [[-161, -49, -6], [36, -84], [-53, 29, 2, -167, -111], [-163, -46], [-41, -91], [-71, 29, 35, -187, -53, -196, -66]]

Answer: [-6, 36, 29, -46, -41, 35]


Question: [[-111, -88, -179, 51], [38, -77, 5], [-4, -185, 32, -191, -82], [-191, -170, -36, 43, 60], [-117, -81, -197, -90, 26, 6, -112], [-9, 8, -79], [28, -200, -50, 82, -125, 99, -30]]

Answer:
[51, 38, 32, 60, 26, 8, 99]