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: [[-190, 12, -59, 9, 100, 83], [-187, 40, 97, 8, -29], [77, -190], [-153, 11], [17, -89, -75, 52, -112, -52, 51], [-60, -103, -79, 74], [-86, -4, 55, 99], [-69, -25, -52], [8, -62]]

A: [100, 97, 77, 11, 52, 74, 99, -25, 8]
****
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: [[25, -25, -74, -112, 32, 95, 40], [-147, 7, 62, -96, -168, -51], [-62, -199], [-162, -94, 90, -185], [-78, -129, 13, -72], [75, -107, -144, -162, 63, -191, 93], [22, -55, 9]]

A:
[95, 62, -62, 90, 13, 93, 22]
****