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: [[-138, -16, -188, -181, 86, -151], [56, -176, 31, -164, 39, 51]]

A: [86, 56]
****
Q: [[-71, -64, 0, -111, -147], [-125, -117, -120, 6, 89, -173], [-108, -17, -92, 2], [-199, -19, 98, -189, -198, -30], [-30, -175, -73, 32, 35, -141], [-54, 100], [3, -107, -198, -178, -135]]

A:
[0, 89, 2, 98, 35, 100, 3]
****