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: [[61, -35, -161], [-87, 73], [-82, 78, -19, -170], [-169, -132, 71], [-99, -136, -127], [88, -173, 0, 74, -8, 73], [-111, -164, -30]]

A: [61, 73, 78, 71, -99, 88, -30]
****
Q: [[5, 20], [36, -36, -177, -145], [90, -26, -6, 12, 94]]

A: [20, 36, 94]
****
Q: [[33, -110, 39, -134, 78, -99, 58], [-120, -156, -97], [16, -174], [-196, 81, 71, -69], [-44, -11, -181, -19, -158, -39]]

A:
[78, -97, 16, 81, -11]
****