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: [[-103, -43, 55, 15, -19], [21, -7, -107, -40, -189], [-111, 75, 73, -198, -190], [-135, 82, -144, -32, 84, -98]]

Answer: [55, 21, 75, 84]


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: [[-1, -80, -69, -160], [-91, -171, 52], [8, -195, -150, 26, 23, -55, -126], [-103, -98, -176], [-22, -185], [-124, -34, -121, -172, -8, -61], [81, 94, 38, -32, -117, -57, 75]]

Answer:
[-1, 52, 26, -98, -22, -8, 94]