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: [[9, 77, 13, -72], [-100, 81, -199, -3, -197, -12], [85, 59, -67, -35], [25, 93], [-80, 54], [29, 50, -184, 88, -106]]

Answer: [77, 81, 85, 93, 54, 88]


Question: [[-15, -94, 89, -134, 90, -163, 7], [65, -139, 15, -154, -185, -165, -127], [-120, -148, -158, 16], [-57, 14, 93, -38, -4], [-51, -144, 30, -135, -105]]

Answer: [90, 65, 16, 93, 30]


Question: [[-33, -124, -25, -131, 58, -157, 89], [-138, -82, -187], [-180, -129, 72, -157, -40, -71, -195], [-122, 91, -172, -65], [-32, -124, 55, 21], [-154, -109, -112], [-167, 44], [-1, -29, -88, -119, -194]]

Answer:
[89, -82, 72, 91, 55, -109, 44, -1]