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: [[38, -34, 24, 52, -11, 5], [-79, -185, 72, -181, 76], [-87, 25, 70, -182], [-10, 93, -144], [-96, -18, -23, 26, -100], [-79, 41, 99, -121, -68, -11], [-133, -37, -58, 12, -84, -79], [93, 94, -160, -81, -128, -122, -42]]

A: [52, 76, 70, 93, 26, 99, 12, 94]
****
Q: [[-170, -186, -15], [-130, -93, -50, 88, -170], [-15, -144, -141], [-85, -104, -115]]

A: [-15, 88, -15, -85]
****
Q: [[-36, -189, -185, 75, -189, -167, -176], [-178, -152], [84, 38, -39, -21, 70, -128], [-136, -63], [47, -106, 91, -96, -40, 99], [-38, -46, -81, -85, 40, -119], [-104, 36], [-42, 41, 58, -34]]

A:
[75, -152, 84, -63, 99, 40, 36, 58]
****