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, -26, -156, 87], [-73, -173, 18, -40, -175, 99], [-171, -75, 15, 18, -90, -162, -104]]
[A]: [87, 99, 18]


[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]: [[-88, 65, 36, 64], [-99, 74, -15, 64, -23], [30, -169, -179, -176, -166, -140]]
[A]:
[65, 74, 30]