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: [[100, 3, -8, -15, -181, 25, -122], [-183, -120], [-95, -183, -94], [-34, -100, -172, 63, -139, -136], [-175, -113, -104, 50], [-170, -139], [-159, 80, 29, -100, -142, -108, -36], [56, -11], [-120, -109, -28, 88, -145, -92]]

A: [100, -120, -94, 63, 50, -139, 80, 56, 88]
****
Q: [[-100, -43, 9], [-4, -170, 48, -129, 49, 83], [41, -102, -98, 81], [27, -183, 93, 47, -13, 51], [2, -61, -170, -73, 48], [2, -118, -152, -141], [-168, -73, -166], [15, 50, 32, 4]]

A: [9, 83, 81, 93, 48, 2, -73, 50]
****
Q: [[71, 16, 38, -167, -162], [-91, -135], [-53, -164, -107, -20, -158], [-84, 12], [-112, -185, -199, -38], [-18, -54, 7, -18], [-138, 73, 100, -132], [-174, -137, 80], [-65, 73, 26, -131, -123, 5, 79]]

A:
[71, -91, -20, 12, -38, 7, 100, 80, 79]
****