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: [[51, 10, -181, -96], [-40, 69, 46, -116, 53], [-135, 92], [-151, 35, -65, 52], [23, -125, 82, 57, -57], [-185, -94, -73, -131, -191, 70, -154], [9, 65, 41]]

A: [51, 69, 92, 52, 82, 70, 65]
****
Q: [[-1, 80, -4, 63], [-191, -139, 22, 31, -145], [-154, -165, 43, -190]]

A: [80, 31, 43]
****
Q: [[-49, -158, -65, -63, 82], [-61, 52, 42, 94], [97, 13, 36, 22, -166, -128], [-4, -198, 33, -193], [57, -69, -166], [-125, -24, -3, -91]]

A:
[82, 94, 97, 33, 57, -3]
****