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]: [[-60, -149, -20], [31, -93, -100, -187, -19, 18, 93], [-171, 17], [-97, -86, -188, -76, 91], [5, 69, -169], [-148, 44], [-180, -21, -51, -198], [-193, -197, -103, 98, 80, -148], [-158, -43, 25, -150, -153]]
[A]: [-20, 93, 17, 91, 69, 44, -21, 98, 25]


[Q]: [[-42, -57, 13, -41], [45, -68, -199]]
[A]: [13, 45]


[Q]: [[30, -25, -16, 39, -16], [-51, -147, 12, -150, -58, -35], [5, 45], [24, 3]]
[A]:
[39, 12, 45, 24]