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]: [[70, -85, -168, -181, -49, -105], [-178, -54, -86, -113, -16], [1, 51, -127, -18], [-61, 80, -64], [-45, -175, -125], [-138, -96, -112, -14, -77, -188], [84, -96, 32, -165], [-125, -42, 88, 4, 60, -122, 89], [49, -84]]
[A]: [70, -16, 51, 80, -45, -14, 84, 89, 49]


[Q]: [[45, -200, -173, 19, 51, 78, -110], [-38, -174, -91], [78, -16, 50, -175]]
[A]:
[78, -38, 78]