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: [[-110, -23, -169, 17, -26], [-173, -98, 69, 24], [-57, 55, 60, 96, -31, -136], [-68, -152, -107, 74, 75], [-122, 20, -98, 36, -48, -92], [-178, -151]]

Answer: [17, 69, 96, 75, 36, -151]


Question: [[44, -5, -161, 1, 67], [-100, -72], [-66, 43, -169, -68, -146], [7, -104, -165], [-7, -88, 10, 94, -158]]

Answer:
[67, -72, 43, 7, 94]