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: [[95, 39, -13, -74, -49, -40, 31], [57, -5, 12, -24, 50, 50, 14], [-195, -144], [-90, 66], [-151, -149, -117, 54, 41, -168], [-67, 52, -41, -156, 24, 37], [-48, 20, 93, -94, -152], [-80, -95, 100, -95], [-178, 21]]

A: [95, 57, -144, 66, 54, 52, 93, 100, 21]
****
Q: [[-102, 46, -150, -150], [-151, -137]]

A: [46, -137]
****
Q: [[86, 62], [97, -84, -141, -98, -31, -95], [-56, -75], [-182, -86, 6, -121], [-24, -84, -156, -193, -114], [-14, -154, 37, -116], [-100, -195, -65, 72, 38], [89, -34, -63], [-118, 20, 89, -156]]

A:
[86, 97, -56, 6, -24, 37, 72, 89, 89]
****