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: [[-153, -194, 66, -24], [-9, -170, -188, -20, 16], [-160, -44, -44, 16, 2, -146], [10, -66, -148, 69, -48], [12, -55, -153, -2, -11], [-149, 38, 27, -107, 80, -183]]

A: [66, 16, 16, 69, 12, 80]
****
Q: [[73, -168, -140, -199, -167, -176, -34], [-172, -186], [3, 72, 49, -174], [-112, 39, -46, -152, 11, -127, -185], [97, 26, -147, -189, -11], [-50, -42, 7, -8, 68]]

A:
[73, -172, 72, 39, 97, 68]
****