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: [[83, -105, -170, -58, -169, -177], [79, -174, 31], [34, 33, -127], [-141, 49, -55], [-48, 11, -2, -9, -21], [-75, -46, -144, -106, -46, -35, 75], [-6, -177, -101], [67, 44, -184, -93, -106, 41], [-135, -96]]

Answer: [83, 79, 34, 49, 11, 75, -6, 67, -96]


Question: [[32, -174, -116, -146, -74, 87, -87], [-102, -165, 7, -84, -82], [73, -170, -66], [-110, 69, -136, 39, -1, 1, -145], [-8, -27, -66, 44, 71, 96, -193], [-106, -134], [5, 26, 26, 48, -103], [-35, -137, -99, -117, 84]]

Answer: [87, 7, 73, 69, 96, -106, 48, 84]


Question: [[-39, -93, -83, -166], [-138, 81, -78, -143]]

Answer:
[-39, 81]