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: [[95, 39, -13, -74, -49, -40, 31], [57, -5, 12, -24, 50, 50, 14], [-195, -144], [-90, 66], [-151, -149, -117, 54, 41, -168], [-67, 52, -41, -156, 24, 37], [-48, 20, 93, -94, -152], [-80, -95, 100, -95], [-178, 21]]

A: [95, 57, -144, 66, 54, 52, 93, 100, 21]
****
Q: [[75, -168, -26, -170, -66, 46, -55], [-24, 95, -6], [-138, -147, 53, 1, -161, 70, -180], [7, 68, -48, -112, -121, -178, 44], [100, -87], [-95, -99, -2], [-90, -10, 15, -177, 6, -46], [-78, -99, -136, -41, 20, 32, -187], [-168, 97]]

A: [75, 95, 70, 68, 100, -2, 15, 32, 97]
****
Q: [[-13, -137], [-88, 69, -65, -190, -8], [-196, -136, -141, -33], [-65, -174, -2, 57, -48], [4, -118, -1, 30, -39, 89, 65]]

A:
[-13, 69, -33, 57, 89]
****