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]: [[35, -126], [-21, 82, -21], [-175, -59, -200, 27], [50, 6, -137, 58, -71, -30, -91], [-103, -132]]
[A]: [35, 82, 27, 58, -103]


[Q]: [[-51, -178, -162, 41], [53, -78, -181, -186, -64], [-58, -99, -2, 0], [-42, -175, 30]]
[A]:
[41, 53, 0, 30]