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]: [[73, -86, -24, -107, 43], [-26, -60, -75, -9, -165], [-134, 87, 97], [100, -87, -94, -163, -189, 87, 85]]
[A]: [73, -9, 97, 100]


[Q]: [[-2, -59, -139, -19, -120], [-148, 59, 73, -148, 27], [94, -73, -135, 45, -75, 23], [81, -132, 2, -132, 49]]
[A]: [-2, 73, 94, 81]


[Q]: [[-38, -56, -187, -157, -7, 46], [52, -138, 0, -11, 23, -25, -200], [-68, -176, -101, -115], [-148, -106, -193], [-108, -25, -2, 10, -66, -66]]
[A]:
[46, 52, -68, -106, 10]