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: [[-116, 8, -187, -74, -77], [-94, -11], [-145, -120, -47], [-178, -61, -91, -105, 24, 20], [61, -196, -157, -35, 35, -43, -195], [-193, -67], [-44, -22, -119, -11, -193], [70, -153, -120, 14, -140], [10, -170, -131, 6, -151]]

Answer: [8, -11, -47, 24, 61, -67, -11, 70, 10]


Question: [[-120, 64, 10, -43], [-7, -30, -37, -45, 4, -185], [-17, 44, -62, -97, -5, 10, -20], [7, 91, -56, 24], [-138, -169, -139, -172, 57, -53], [62, 31, 12, 20, -182, -188, -198], [-45, -3, -11, -187], [-10, -200, -76, -160, -151]]

Answer: [64, 4, 44, 91, 57, 62, -3, -10]


Question: [[-113, -61, -44], [-23, -162, -164], [21, -179, -14, -59, -20, -163, -54], [-147, -181, -123], [-56, 93, 51]]

Answer:
[-44, -23, 21, -123, 93]