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]: [[53, -158, -69, 79, -98, -187, 65], [0, -152], [-171, -149, -71, -181, -72, -155], [32, 31, -153], [78, 34, -148, -1, 98, -69], [-157, 26, -9, -200], [-147, 20], [-85, 70, 35, -84, 25, -58]]
[A]: [79, 0, -71, 32, 98, 26, 20, 70]


[Q]: [[-187, -52, -138, 33], [-32, -176, -198, -74, 66], [95, -187, 82, -51, -114]]
[A]: [33, 66, 95]


[Q]: [[56, 97, 38], [84, -3, -49], [64, -141, 69, -106, -169, 39, -178], [-57, -42, -11, -181], [-11, 95, -60, 81]]
[A]:
[97, 84, 69, -11, 95]