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]: [[-92, -149], [-178, -95, 30, 90], [8, -122, -101, -194, -47, -192], [74, -174, -102, 37, -119, -102], [-135, -136, -126], [-186, -117, 6], [7, -114, -109, -31, -103, -61], [-147, -86, -163]]
[A]: [-92, 90, 8, 74, -126, 6, 7, -86]


[Q]: [[-23, 46, -103, -74, 16], [-161, -180, 34, -156], [80, -153], [76, -198, -198, -126, 47, -59, -193], [-99, -78, -127, 68, 68, -194, -121]]
[A]: [46, 34, 80, 76, 68]


[Q]: [[50, -33], [-184, -165, 18, -44], [-32, -193, 58], [-130, -140, 44, 58, -108, -111], [25, -12, 71, -13, -176, -28, -97], [-77, 15, -118, -26, 79], [-87, 67, -176, -197], [-133, -160, -40], [-108, -120, -74]]
[A]:
[50, 18, 58, 58, 71, 79, 67, -40, -74]