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: [[-59, 10, -4, -62], [-94, -163, -126, -159, -59], [87, -50, -102, -181, 99, -138], [48, -154, 17, -191], [-35, -12, -114, 18, -184], [80, 16, -193]]

A: [10, -59, 99, 48, 18, 80]
****
Q: [[42, 86, -134, 77], [-175, 33, -14, 21, -83], [-16, -66, -132, -60], [-125, 46], [-28, 59, 70, 57, -161, -86, -91], [-35, 98, -179, -67, 78], [-176, -102, 41], [-69, 1], [-13, 90, -168]]

A:
[86, 33, -16, 46, 70, 98, 41, 1, 90]
****