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]: [[-134, -121, 72, 82, -12, -28], [67, 87, 98, -58, -57, 6, 84], [-46, 76, -179, 21, -132, -46], [12, -67, -19, -46], [-62, -22, 58, -139, -39, -118], [-5, -170, 85, -75, -126, 53, -63], [9, -82, 7], [-88, -111, -81, 86, -17, 36, -160]]
[A]: [82, 98, 76, 12, 58, 85, 9, 86]


[Q]: [[-47, -152, 20, -130, -79], [-28, 80, -65, -110, -14, -30, -87], [-94, -22], [27, -130, -199], [-116, -101, -139, 6, -141], [-27, -182, -48, -73, -10, -133, -189], [-70, 64, 8, 82, -133, -136, 23], [-1, -194]]
[A]:
[20, 80, -22, 27, 6, -10, 82, -1]