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: [[52, -128, -179, -149, 20, -143], [-174, -30, -84, -103, 39, -123, -85], [-52, 86, -77, 10, 58, -150, 95], [-165, -32, -190, -88, 2], [-21, -113, -67, -17, -39, -177], [-124, -40, 57], [73, -171, -187], [70, 37, 45, -160, -78], [-48, 44, -59, -75, -63, -77]]

A: [52, 39, 95, 2, -17, 57, 73, 70, 44]
****
Q: [[-53, -26, -156, 87], [-73, -173, 18, -40, -175, 99], [-171, -75, 15, 18, -90, -162, -104]]

A: [87, 99, 18]
****
Q: [[-29, -131, 31, 91, -159, 81], [65, -118, 41, 92], [68, -157, -46], [25, 10, -48, -167, -8]]

A:
[91, 92, 68, 25]
****