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]: [[-123, -64, -37, -55], [-170, -193, 73, 94], [-21, -159, -100], [-59, -193, -156, 76], [21, -147, -140, -165, 85, -14], [-51, 57, 85, 1, -69, 93], [-156, -17, 72], [-48, -165, -96, -148, 5, -147], [-81, -55, 87, -12, -9]]
[A]: [-37, 94, -21, 76, 85, 93, 72, 5, 87]


[Q]: [[-31, -48], [7, -142, -76]]
[A]: [-31, 7]


[Q]: [[-46, -79, -80, 91, -47, -52, -72], [-41, -142, 57, -145, -128], [-9, -71, -112, -30, -130], [-167, -185, -24, 33], [35, -168, -114, -52, -39, -31, 21], [-107, -71, -155, -105, -62, -165], [12, -43, -26, -98, -138], [37, -188]]
[A]:
[91, 57, -9, 33, 35, -62, 12, 37]