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]: [[-12, 25, 90, -161, -90, -10, -71], [5, -63, -36, 98, -7], [20, -168, 22, -198], [-89, 83, -185, -69, -110, 85], [-7, -27, 3, 64, -132, 36, -40], [37, 68, 77, -51], [-143, 48, -53, 6, 63, 58], [-162, -152]]
[A]: [90, 98, 22, 85, 64, 77, 63, -152]


[Q]: [[-56, 1, 91, 72, -43, 93, 97], [82, -37, 68, 90, -1], [-77, -107, -45, -85, 93], [48, -60, -115, -121, 52, -56, -173], [-75, -154, 52, -51, -70], [-133, -87, -29, -183, -168], [37, -115, -149, -51], [-168, -135, 79], [-46, 13, 24, -91, -91, 80]]
[A]: [97, 90, 93, 52, 52, -29, 37, 79, 80]


[Q]: [[-42, -24], [-79, -66, 27, 82, -72, -115, -171], [-138, -34, -65, -123, -179], [-136, 80, -191, 49, -17, -74]]
[A]:
[-24, 82, -34, 80]