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]: [[-127, 43, -163, -34, -6], [11, -75, -155, -25, 7, -180, -37], [-192, 11, -104, -54], [58, -177], [-59, -138, 2, 21, -33, -194, -135], [100, -111, -180, 15, 22], [-74, -116, 25, -117]]
[A]: [43, 11, 11, 58, 21, 100, 25]


[Q]: [[-153, -42, -80], [4, 30], [87, -57, -137, -85, -188, -158], [-89, -68, -173, 34]]
[A]: [-42, 30, 87, 34]


[Q]: [[35, 100, -101, -139, 91, -124], [-197, 23, -163, -152], [-11, -16, -163, -27, -20, 94], [-151, -6, -17, -182, -200, -31, -134], [50, -172], [77, 35, -49, -182, -171, -120], [68, -40, -65, -192, -110, -190]]
[A]:
[100, 23, 94, -6, 50, 77, 68]