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]: [[-49, 17], [-191, -6, -103, 85, -156, -163], [17, 20], [70, 50, -41, 39, -122, -66, -156], [-66, 12, 12, -1], [73, -75, -105, -96, -153, 3, -153], [72, -56, 76, 90, 33, 3, -145], [-9, 52, -65, -100, 59, -41], [-76, 58]]
[A]: [17, 85, 20, 70, 12, 73, 90, 59, 58]


[Q]: [[91, -34, 63], [10, -130, 82, 21, 45], [-115, 18, -41, -36, -96], [-147, 46, -124, -139], [-173, -23, 37, -171, -65, -21, -42], [-191, -172, -147, 17, -27, -124], [19, 46], [-46, -174, 74]]
[A]: [91, 82, 18, 46, 37, 17, 46, 74]


[Q]: [[66, -183], [-177, -16, 47, -64, -19, -178], [48, -46, 17, -156], [-85, -21, -71, -191], [-125, -174, -79, -140], [-184, 78, -56, -71, -136], [-130, 90, 65, -112], [25, 67, 66]]
[A]:
[66, 47, 48, -21, -79, 78, 90, 67]