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]: [[-187, -150, -33], [-15, 40, -23, -77, -8, 49], [-40, 11, 37], [-136, -34], [25, 64, 77, 92, -190], [-43, -9, 57, -11, -185, -188, -127], [-58, 19, -27, -64], [51, -46, -19, 72], [-92, -199]]
[A]: [-33, 49, 37, -34, 92, 57, 19, 72, -92]


[Q]: [[-115, -177, 49, -176, -199], [2, 68, -35, 54, 43, -130]]
[A]: [49, 68]


[Q]: [[-190, 9, -192, 22], [-54, -86, 54, -114, -147, -30], [40, 81, -192, 23, 80], [15, -138, -55, -193, 87, -123], [-192, 96], [-114, 0, -21, -163, -53, 51], [-76, -28, -189, -187]]
[A]:
[22, 54, 81, 87, 96, 51, -28]