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.

Q: [[-190, 12, -59, 9, 100, 83], [-187, 40, 97, 8, -29], [77, -190], [-153, 11], [17, -89, -75, 52, -112, -52, 51], [-60, -103, -79, 74], [-86, -4, 55, 99], [-69, -25, -52], [8, -62]]

A: [100, 97, 77, 11, 52, 74, 99, -25, 8]
****
Q: [[-130, -20, -171, -122, 49, -43], [-173, -82, 17], [87, -55, -70, -113], [69, 10, -121, -177]]

A: [49, 17, 87, 69]
****
Q: [[76, -137, 39], [-159, -171, -5, -137, -103, 5], [88, 52], [-133, 6, 84, -110, -126, 18, -4], [-58, 66, -28], [-143, 20, 69, -92]]

A:
[76, 5, 88, 84, 66, 69]
****