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]: [[-49, 17], [-191, -6, -103, 85, -156, -163], [17, 20], [70, 50, -41, 39, -122, -66, -156], [-66, 12, 12, -1], [73, -75, -105, -96, -153, 3, -153], [72, -56, 76, 90, 33, 3, -145], [-9, 52, -65, -100, 59, -41], [-76, 58]]
[A]: [17, 85, 20, 70, 12, 73, 90, 59, 58]


[Q]: [[-26, -118, -136, -177, -61, -195, -191], [-118, -3, -34, -155, -125]]
[A]: [-26, -3]


[Q]: [[-38, 27, -90, 0, 39, -65], [-171, -11, -43, -116, 75, -187]]
[A]:
[39, 75]