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: [[80, -88, 28, 30, 69, 3], [55, -51, -83, 56, -134, 39, -32], [-66, -147, 46], [-169, 29, 6], [-140, 14, -116, -172, -85, -173, 3]]

A: [80, 56, 46, 29, 14]
****
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: [[-159, 51, -75, 25, 5], [-91, -70, -31, -13], [78, 20], [-134, 90, 42, 46, -129, 100, -120]]

A:
[51, -13, 78, 100]
****