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: [[-122, -130], [-22, 85, 73, -35], [-134, -96, 30], [49, -68, -166], [-75, -193, -193], [68, 50, -166, -111, -65, 25], [-109, 72, 22, -170, -106, -32, 66]]

A: [-122, 85, 30, 49, -75, 68, 72]
****
Q: [[-191, 84, -188], [58, -44, -167, -105, 37], [-92, -44, 3, 23, 26, 37], [-107, -65, 55, 81], [-32, 58], [31, -25, -80, -152, -111, -154, -147], [-166, -135]]

A: [84, 58, 37, 81, 58, 31, -135]
****
Q: [[1, -62, -103, -94, -197, -128, -158], [-115, 62, 65, 23, -61], [23, -95, 35, -20, 11], [-87, 18, 8, -42], [-188, -167], [31, 94, -1, 75], [-200, -187, -108]]

A:
[1, 65, 35, 18, -167, 94, -108]
****