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]: [[-42, -152, -122, -79], [-85, 39, 36, -53], [83, 52], [-31, -2, -176, -152, -107, 44, 62], [10, -163, -16], [44, 33, 55, -59, 1, -30, -19]]
[A]: [-42, 39, 83, 62, 10, 55]


[Q]: [[-179, -61], [-68, -169, -177], [-103, -165], [-12, 40, -44, 97]]
[A]: [-61, -68, -103, 97]


[Q]: [[-141, -172, -123, -43], [-88, 29, -99], [-165, -116, 45, 32, -157, -76, 35], [-75, 5, -185, 34, -128, 31, -136], [-169, -96, 66, 97, -87, -26], [-134, 71, -88, 67, -75, 84, 70], [37, -9], [87, -176, 18], [97, 61, -184, -81, -178, -9, -12]]
[A]:
[-43, 29, 45, 34, 97, 84, 37, 87, 97]