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: [[-58, -176, 95, -113, 67, -164], [97, 98, -87, 68], [57, 21, 86]]

A: [95, 98, 86]
****
Q: [[-157, 50], [-159, 13, -76], [-70, -152], [-49, -84, 76, -132], [13, -138, 55, -8, -141, -25, 66], [43, -128, -12, -144, 95, -162, 92]]

A:
[50, 13, -70, 76, 66, 95]
****