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: [[-107, 41, 2, -56, -164, -190], [-61, -10]]

Answer: [41, -10]


Question: [[75, -154, -179, -44], [-46, 5, -27, -68, -112], [-200, 64, 56, -97, -109, -152, 96], [-129, -77, 58, -70], [29, 93, -138, -195, -141, 72, -181], [-133, -49, -200], [-5, -144, -95, -91, -99], [82, -69], [-195, -120, -86, -177, 30, 22, 92]]

Answer: [75, 5, 96, 58, 93, -49, -5, 82, 92]


Question: [[-58, -200, -148, 72, 25, -156, -32], [-110, -114, 30, 18, -76, -92], [-58, 26, -18, 67, 48], [86, -15, 72, -97, -87, -178]]

Answer:
[72, 30, 67, 86]