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: [[-42, -152, -122, -79], [-85, 39, 36, -53], [83, 52], [-31, -2, -176, -152, -107, 44, 62], [10, -163, -16], [44, 33, 55, -59, 1, -30, -19]]

A: [-42, 39, 83, 62, 10, 55]
****
Q: [[-81, 65, -143, -49, -125, 36, -53], [-37, -168, 75], [-192, 56, 4, 48, 69, -141, -79], [-75, -151, -50, 0, -158, -195, 44], [-159, -180, -122, -57, 52, 18, -94], [-32, 2, -54, -25, 16, -52]]

A: [65, 75, 69, 44, 52, 16]
****
Q: [[83, -90, -140, -5, 36], [-50, -154, 80, 71], [1, -91, -97, -199, 76, 4], [-62, -80, -32], [50, -74, -30, 66], [-103, -127], [1, 18, -134], [-68, -180, -134, -128, 8, -87], [-130, -41, -39, -188, 6, -114, -185]]

A:
[83, 80, 76, -32, 66, -103, 18, 8, 6]
****