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: [[71, -129, -179, -116], [-38, 71, -114, -9], [-38, -148, -160], [-157, -176, -97, 60], [-183, -142, 7, -162], [97, -20, -160, -105, -98], [-98, 76]]

Answer: [71, 71, -38, 60, 7, 97, 76]


Question: [[38, -167, -114, 78], [-12, -192, 25, -91, 2, 70], [89, -55, 50], [-38, -136, -136, -160, -57, -126, 9]]

Answer: [78, 70, 89, 9]


Question: [[-192, -47, -157, -196], [82, -50, 67, -200, -17], [-92, -55, -49, -69, -132], [79, -3, 52], [-150, -60, -116, -116, 98], [73, -195], [-162, -110, -14], [62, -87, -13, -118], [-15, -110, -118]]

Answer:
[-47, 82, -49, 79, 98, 73, -14, 62, -15]