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]: [[99, 11, 61, -95], [-186, -124, -20, -125], [-50, 93, -17], [-165, 56, 52, -142], [-88, -46, -178, -37, -126, 24], [84, 100, 18, 71, -135, 44, 96]]
[A]: [99, -20, 93, 56, 24, 100]


[Q]: [[-73, 37, -21, -114, -70, -143, -15], [-28, -38, 32, -102], [-192, -47, 34, -51, -69, 1, -118], [-161, -3, -23], [-176, -187, 97, -134], [97, -175], [61, -159, -108, -179, 68]]
[A]: [37, 32, 34, -3, 97, 97, 68]


[Q]: [[-116, 83, -154, 43, -125, -111, 19], [-9, -131], [-159, -23, -76, -100, -50, -125, 82], [40, -132, -107, -177, 2], [-96, -176, -174]]
[A]:
[83, -9, 82, 40, -96]