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: [[-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: [[53, -110, 46, -100, -61, -121], [-108, -24, -6, -175, 41, -41], [-184, 80, 24], [-159, -54, 91, 38, -145, 40, 98], [-92, -87, 36, 91], [-33, -199, 62]]

A: [53, 41, 80, 98, 91, 62]
****
Q: [[-164, -39, 29, -50], [-191, 38, 42], [-69, -85, -178, -55, -6, -110], [-196, 43, 53, 21, 69, 99], [91, -170, 82, 15], [-152, 35]]

A:
[29, 42, -6, 99, 91, 35]
****