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: [[0, -183, -46, -46, -108], [-131, -150], [-93, 75, 9, 47, -33, 54, 16], [-77, -63, 29, 100, -186, -95, -84], [-115, -140, 73, -191, -117, 90], [-165, 95, 31, -180, -104, -180], [-173, -24], [13, -54, -180, -25, -46, -42], [-96, -133, 10, -61, -74]]

A: [0, -131, 75, 100, 90, 95, -24, 13, 10]
****
Q: [[95, -34, -73, 46, 51, -185, -192], [-43, -56, -90, -52], [59, 91], [90, 18, 33, -33, -62, -52]]

A: [95, -43, 91, 90]
****
Q: [[-76, -26, -165, 74, -62, -180], [-158, -35, 27, -66, 18, -96], [-179, 74, -55, -47], [-123, -82, 29], [-160, -129, -59, -187, -32], [-152, 89, 99, 79, 46]]

A:
[74, 27, 74, 29, -32, 99]
****