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]: [[-132, 51, -121], [-123, -194, -188, 49, 47, -33, -10], [86, -119, -59, 58, 74, -75, 77], [-65, -109, 66, -108, -51], [30, 74, -151, -11, -11, -30], [-151, -181], [-117, 32, 49, -173], [-176, -152, 25, -56, -15]]
[A]: [51, 49, 86, 66, 74, -151, 49, 25]


[Q]: [[-49, -62, -1, -26], [95, -180, -35, -102, -112, -113], [-130, -37, -2, 27, -74], [-166, -61, 27, 70, -11], [-31, -101, -54, -108, 13], [-77, -105], [-138, -30, -116, -120, -153, -116, -58], [-58, -10, -84, 7, -114, -16, -128]]
[A]:
[-1, 95, 27, 70, 13, -77, -30, 7]