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: [[51, 10, -181, -96], [-40, 69, 46, -116, 53], [-135, 92], [-151, 35, -65, 52], [23, -125, 82, 57, -57], [-185, -94, -73, -131, -191, 70, -154], [9, 65, 41]]

A: [51, 69, 92, 52, 82, 70, 65]
****
Q: [[-49, 17], [-191, -6, -103, 85, -156, -163], [17, 20], [70, 50, -41, 39, -122, -66, -156], [-66, 12, 12, -1], [73, -75, -105, -96, -153, 3, -153], [72, -56, 76, 90, 33, 3, -145], [-9, 52, -65, -100, 59, -41], [-76, 58]]

A: [17, 85, 20, 70, 12, 73, 90, 59, 58]
****
Q: [[-16, -134, -161, -189, 74, -61, -110], [35, -190, -125, -142], [-143, -67, -42], [-64, -109, -196], [21, -122, -166], [-47, -194, 89], [-197, -87, 89, -99]]

A:
[74, 35, -42, -64, 21, 89, 89]
****