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: [[-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: [[-79, -29, 95, 11, -47, -37], [-61, -14, 2, 63, 18, -44, 60], [67, -61, -152, -108, -184, 85], [-7, -135, -113, -81, -146, -34], [74, 58], [-139, 40, -181, -95], [83, -28, -200], [80, -130, -174, 36, 19], [12, 70, -198, -62]]

Answer: [95, 63, 85, -7, 74, 40, 83, 80, 70]


Question: [[-182, -77, -152, 3], [-196, -141, -136, -41], [-141, 56, 91, -102], [-190, -107, 2, 67, 60], [-41, 42, 94, -88, -74, -131], [68, 79, 74, -128], [-47, -48, 99, 18, -119, -94, -106], [-112, -26, -175, -195, 1], [-2, -168, 99, -163, -145]]

Answer:
[3, -41, 91, 67, 94, 79, 99, 1, 99]