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: [[-171, 49, -188, -34, -186], [-101, 34], [10, -98], [-44, 14, -6, -91, -92, 52, -111], [-79, 76, -30, -53, -129, 78, -158], [-7, -181, -163, -81, 31], [-28, -162, -154, -23, -170, 30], [18, -84]]

Answer: [49, 34, 10, 52, 78, 31, 30, 18]


Question: [[51, -67, -81, -30, 67, -10, -110], [-187, 85], [-127, -137, -194, 90, -185, -149, -163], [-54, -34, -105, -77, -65, 76], [-121, 81, -112, -28], [-65, 97, 98], [8, -183, 72, -81, 15, 94, 32]]

Answer: [67, 85, 90, 76, 81, 98, 94]


Question: [[-143, 55, -29, -193, -49, 10, -99], [73, 11], [-33, 17, -108, -116, -39, 18], [-93, 59, -107], [-39, 15], [90, 79, 33, 86], [56, -142, -130, -141, 74]]

Answer:
[55, 73, 18, 59, 15, 90, 74]