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]: [[-191, 84, -188], [58, -44, -167, -105, 37], [-92, -44, 3, 23, 26, 37], [-107, -65, 55, 81], [-32, 58], [31, -25, -80, -152, -111, -154, -147], [-166, -135]]
[A]: [84, 58, 37, 81, 58, 31, -135]


[Q]: [[-22, -69, -38, -9, -92, 36], [-169, -140, -163, 86], [10, -73, -36], [-124, 53, 81, -61, 65, -184, -170], [69, -177, -73], [-112, 41, -38], [91, 31, 85, -72, -93, -48, 66], [-73, -180, 34, 16, -175, -28]]
[A]: [36, 86, 10, 81, 69, 41, 91, 34]


[Q]: [[16, -157], [-10, 64], [-117, -185, 94], [-107, -179, -117, -166], [73, -30], [66, 8, -9, -102, -79], [83, 25, -192, 96, 77, 32, -57]]
[A]:
[16, 64, 94, -107, 73, 66, 96]