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: [[0, -183, -46, -46, -108], [-131, -150], [-93, 75, 9, 47, -33, 54, 16], [-77, -63, 29, 100, -186, -95, -84], [-115, -140, 73, -191, -117, 90], [-165, 95, 31, -180, -104, -180], [-173, -24], [13, -54, -180, -25, -46, -42], [-96, -133, 10, -61, -74]]

Answer: [0, -131, 75, 100, 90, 95, -24, 13, 10]


Question: [[-200, -55, -94, 83, -144, -15], [83, -73, -2]]

Answer: [83, 83]


Question: [[-104, -133, -160, 52, -101, -131, -19], [-122, 12, -107, -89, -104, 93, 30], [89, -172, 41, 92, 19, -198, 46], [-171, -193, -172], [-56, -169, 5]]

Answer:
[52, 93, 92, -171, 5]