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: [[-31, -113, -173, -37, -4, -189, -191], [-32, 92, -46]]

A: [-4, 92]
****
Q: [[-75, 58, -1, -188, -187, -72, -179], [-61, 19, 5, -26, 11], [31, 68, -15, -29]]

A: [58, 19, 68]
****
Q: [[-109, 73, -9, -94, -139], [-2, 73], [46, 16, 93, 34, -165, -152], [-123, -48, 42], [56, -161, -36, -32], [73, 98, 76, -176], [-85, -79], [76, -85, -41]]

A:
[73, 73, 93, 42, 56, 98, -79, 76]
****