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: [[-134, -48, 4, 24, 71, -187, -166], [44, 10, 44, -55], [-63, -29, 15, -89, 78, 63, -106], [-112, -11, -134, 87, -46], [-128, -93, 68, -87], [-147, -63, 91]]

A: [71, 44, 78, 87, 68, 91]
****
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: [[-176, 83, 100, 100, -85, -104, -73], [87, 89, -157, -33, 36, -198], [33, 57, -61, -49, -54], [91, -50, 39, -45, -103, -49, 75], [-36, -185, -141, 50], [26, -135, -150, 53, 73], [54, 14, -71, -103, -200]]

A:
[100, 89, 57, 91, 50, 73, 54]
****