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: [[100, -56, -195, -111], [-102, -4, -87, -166, -68, 84, -157], [-63, -119, -190], [-144, -55], [-103, 19, 5, 78, -135, -153], [58, 15, -108, -178], [36, 73, -175, -74, -179, 86], [29, 41, 99, -75, -22, -174]]

Answer: [100, 84, -63, -55, 78, 58, 86, 99]


Question: [[34, -28, -82, 73, -107, -173], [-23, -123, -142, 26, -22, -200, -131], [-142, -55, -194, 81, -194, -19, -19], [-53, -97, 48, -30, -189, -9, -22], [-117, 31, -8, -83], [25, -11], [34, -163, -82, 44, -43, 16], [-124, -84, 31, 10, 30]]

Answer: [73, 26, 81, 48, 31, 25, 44, 31]


Question: [[-197, 65, -141, -166, -138], [-73, 61, -12, 9, 85, -7], [-100, 54, -138, -81], [-64, 25, 31, -158, 31, -73], [-8, 79, -61, -170, -22, -31, -135], [-200, 60, -161, -66], [98, 81, 55, -55, -198, -150]]

Answer:
[65, 85, 54, 31, 79, 60, 98]