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: [[80, -88, 28, 30, 69, 3], [55, -51, -83, 56, -134, 39, -32], [-66, -147, 46], [-169, 29, 6], [-140, 14, -116, -172, -85, -173, 3]]

A: [80, 56, 46, 29, 14]
****
Q: [[-161, 54], [-41, 74], [74, 84, -87, 28, -181], [-44, 9, 40, -67, -193]]

A: [54, 74, 84, 40]
****
Q: [[-15, -54, -102, 86, 30, -114], [37, -54, -51, -149], [67, 32, -45], [-186, -90, -16], [-96, 61], [-108, -55, -63, 98]]

A:
[86, 37, 67, -16, 61, 98]
****