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]: [[61, -35, -161], [-87, 73], [-82, 78, -19, -170], [-169, -132, 71], [-99, -136, -127], [88, -173, 0, 74, -8, 73], [-111, -164, -30]]
[A]: [61, 73, 78, 71, -99, 88, -30]


[Q]: [[-45, -46, -14, 23, -167], [30, -95, 45, 99, -182], [43, -36, 11, 54, -39], [-165, -7, 29, -105, -125, -8], [56, -161, 54, 25, -146, -46, 98], [-189, -185, 82, -122, 59, 95, 38], [65, -34, -10, -33, -35, -125, -50], [-4, 88, -121, -118, 10], [41, -131, -189, -168, -198, -58, 51]]
[A]: [23, 99, 54, 29, 98, 95, 65, 88, 51]


[Q]: [[-127, 38, -4], [-129, -89, 96, -152, -197, -154, 87], [-147, 53], [-188, -106, 61], [-1, -102, -100, -58, -84, 10], [40, -144, 35, -199, -20], [47, -39], [-56, -196, 50, -72, -110, -54], [-3, 85, 75, -20, 69, 48, -135]]
[A]:
[38, 96, 53, 61, 10, 40, 47, 50, 85]