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: [[75, -65, 73, -136, -118], [51, -185], [-115, -90, 10], [53, -191, -159, -180], [-94, -98, -180, -43], [-159, 17, -78, -186], [-198, -111]]

Answer: [75, 51, 10, 53, -43, 17, -111]


Question: [[-68, -107, -111, -52, -133, 80], [-150, 54, 88, -69, 6], [84, -113, 35, -189, -49, -77, 19], [99, -97, -161, 61, -66, -73, 18], [34, -141]]

Answer: [80, 88, 84, 99, 34]


Question: [[-99, 48, -3, 48, -173, -146, -190], [8, -155, -97, 7, -172, -5, -109], [-38, -178], [-103, -71, -128, -140, -130, 53], [9, -99, 70], [88, 83, 6, -54, -155, -55]]

Answer:
[48, 8, -38, 53, 70, 88]