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: [[67, 44, 35, 59], [-191, -183, -154, 76, -98, -165], [50, 63], [72, 30]]

Answer: [67, 76, 63, 72]


Question: [[-105, 91, -50, 93, -119, -108], [-190, -161, -97, -149, -13, 57], [-138, -124, -182, 20, -75, 98, -127], [-200, -188, -102, -171, -179, 60, 29], [-69, -87, 15, -52], [-177, -147, -64], [-147, -198, -141, -67, -9, -135, -106]]

Answer: [93, 57, 98, 60, 15, -64, -9]


Question: [[-2, -59, -64, 100, -151, -138], [11, -13, -180, -107, -158], [-19, -57], [-131, 46, -91, 11, -116], [32, -43, 52, -55, 49, -29], [-75, 86, -50], [-146, -68, -10, -123, -95, -64, 64], [-139, -81, 99], [66, -146, -95, -106, -164]]

Answer:
[100, 11, -19, 46, 52, 86, 64, 99, 66]