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]: [[14, -199], [-96, -75, -1, -54, -147, 98, 70], [2, 49, -99, -98, 48], [45, -143, -123, 36, 77, -115, -27], [-102, -120, -166], [69, -52, -1, -104], [-72, -135], [-77, 69, -114], [-47, -151, -82, -73, 92, -19]]
[A]: [14, 98, 49, 77, -102, 69, -72, 69, 92]


[Q]: [[-11, -143, -61, -79, -59], [-65, -80, -184, 19, -182, -101], [-86, -31, -111, -22], [-43, -24, -80, -185], [-24, -61, 94, 72, -54, 12, -84], [-8, -9, -166, -86, -85]]
[A]:
[-11, 19, -22, -24, 94, -8]