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]: [[-35, -72, -53, -9, 95, 58, -108], [-185, 72, -32, -90], [-117, -124, -172, 52, -37, -183], [-160, -193, -149, 25, -2], [-132, -182, -85], [-69, 39, -167, 57, -132, 13, 43]]
[A]: [95, 72, 52, 25, -85, 57]


[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]: [[90, 67, -19], [-189, 64, -23, -183], [-59, -5, -175, -97, -152], [-174, 76], [-2, 41, 16], [57, 77, 23], [-183, 58, -130, -177, 86, -177], [92, -193]]
[A]:
[90, 64, -5, 76, 41, 77, 86, 92]