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: [[-99, -20, 1, -195], [47, -92, -16, 34, -113, 62, 3], [-200, -20, -92, 100], [-27, -94, 26, -53, -67], [-73, -16, -70, 12, 85, -173, -193], [-183, -64, -9, 56, -73, -21, -76], [-69, -9, -193, -108, -97]]

A: [1, 62, 100, 26, 85, 56, -9]
****
Q: [[-184, -93, -128, -153], [50, -104], [21, -156, -185, 27, 32, -187, -132]]

A: [-93, 50, 32]
****
Q: [[12, -184, 13, -131, 99, 60], [6, -108, 26, -68, 39, -106, -102], [46, -159, 0], [7, 94, -171], [89, 16], [19, -146], [-184, 61, -117, 15, -81, -141, -126], [-127, -166, -119, -65]]

A:
[99, 39, 46, 94, 89, 19, 61, -65]
****