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]: [[-18, -69, 27, -166, -146, -169], [-11, -183, -102, -104, -33, 65, -19], [-27, -147], [-41, -126, -9, -125], [-28, -26], [-33, -92]]
[A]: [27, 65, -27, -9, -26, -33]


[Q]: [[27, -69, -166, -140], [-181, -78, 62, 97, -139, -168, -85], [-191, -20, 50, -74], [-149, -97, -174, -119, -107, 49], [-30, -77, 95, 74, -73, 96, 81], [-129, 87], [-107, -64], [-6, 86, 25, -90, 14, -12, -48], [-128, -3, -67, 76, 56, -157, -158]]
[A]:
[27, 97, 50, 49, 96, 87, -64, 86, 76]