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, -118, 52], [-118, -139, -176, 7, -164, -105, 8], [23, -133], [-158, 54, -118, -120], [-162, -147], [-154, -102, -134, -142, -141, -127, 61], [25, 7], [-151, -160, -44], [92, -66, -39, -131, -53, -166, 30]]

A: [52, 8, 23, 54, -147, 61, 25, -44, 92]
****
Q: [[98, -129, 10], [-55, -168, -73, -44, -68], [-177, 91, 98, 7, -39, 85], [-26, -129, -100, 19], [-154, -80, -1], [50, -171, 3], [49, -164, 98, -108, 9, -18, -176], [-81, -17], [-30, 48, -122, -134]]

A: [98, -44, 98, 19, -1, 50, 98, -17, 48]
****
Q: [[-192, 12, -19, -58, -122], [-36, -114, 92, -196, 77, 32], [-122, 22, -49, -52, -40, -124]]

A:
[12, 92, 22]
****