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: [[6, -22, -195, 87], [-198, 60, 87, 19, 98, -147, 94], [-62, 50], [-159, -118, -193], [-165, -176, -157, -43, -121, -73], [32, 51, -24, -37, 80], [-110, -100, -198, -145]]

A: [87, 98, 50, -118, -43, 80, -100]
****
Q: [[-179, -61], [-68, -169, -177], [-103, -165], [-12, 40, -44, 97]]

A: [-61, -68, -103, 97]
****
Q: [[-104, -62, -183, -191, -33, 76, 51], [-187, -154], [9, -108, -103, -112, 86, -16], [60, -146, 8, -125, 90, -18], [-61, -35, -111, 62, -94, 39], [-117, -168], [42, 49, -8, -152, 99]]

A:
[76, -154, 86, 90, 62, -117, 99]
****