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: [[-128, -182, 21, -87, -194, -165, -9], [-64, -106, -38, -182, -45, -81], [-49, -197, -76, 99, 91], [89, -158, -186, -149], [40, -165, -148, -52, -153, -159], [-61, -69, -139, -1, 23, 0, 46], [69, -133, -27, -135]]

A: [21, -38, 99, 89, 40, 46, 69]
****
Q: [[50, -99, 52, -39, -139, 57, -66], [-50, 61, -23, -169, -153, -162, -81], [-165, -194, 36, -100, -200, -81], [-83, 78, -200, -49, -96]]

A: [57, 61, 36, 78]
****
Q: [[-6, -153, 85, -74, 76], [21, -81, -89, 32, -177], [95, -175, -161, -183, 29], [-69, -95, -122, 94, -41, -8], [-195, 60, -168, -149], [-27, -74, -85, -82], [-156, 64, -188], [-152, 12], [41, 89, -117]]

A:
[85, 32, 95, 94, 60, -27, 64, 12, 89]
****