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: [[38, 7, -17, -108, -56, 8], [-165, 25, -30, -191, -19, -95], [-7, -124, -23, -13], [-83, -144, -95, -92, -2, 1, -73], [5, -111, 30, -128, 40, 2, 5], [59, -103, -28, 92, -106], [-180, 68, -149, 87, -159, -12], [-14, 76], [-95, -128]]

Answer: [38, 25, -7, 1, 40, 92, 87, 76, -95]


Question: [[-57, -10, -27, -160], [-80, -130, -16, 25], [-65, -106, 30, -104, -20, 77], [-192, -87, -49, 64, 43, 94, 82], [-81, -10, 20, -28, 79, 73, -1], [-191, -83, -113, 40, 6]]

Answer: [-10, 25, 77, 94, 79, 40]


Question: [[-74, 16, 11, -16], [-101, -193, 46], [-144, -88, -21, 82, 75, 2], [-187, 23, -3, -65, 1], [-200, -198, -129, -52, 98, 96], [-135, -14, 58, -145, -192, -182], [16, 10, -131, -71, 83, -7, -31], [-146, 96, -149, -104, -2, -30]]

Answer:
[16, 46, 82, 23, 98, 58, 83, 96]