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: [[-81, 65, -143, -49, -125, 36, -53], [-37, -168, 75], [-192, 56, 4, 48, 69, -141, -79], [-75, -151, -50, 0, -158, -195, 44], [-159, -180, -122, -57, 52, 18, -94], [-32, 2, -54, -25, 16, -52]]

A: [65, 75, 69, 44, 52, 16]
****
Q: [[18, 65, 44, -95, -55], [-117, 45], [-29, -66, -85, -25, -53, 9]]

A: [65, 45, 9]
****
Q: [[-180, -25, -11, -122, 84, -198, -37], [13, -162, 29, 10, 17, -74], [-161, -8, -12, 41, -183], [-18, -10, -96, -40, 16, 18]]

A:
[84, 29, 41, 18]
****