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: [[-99, -133, 80, -160], [-10, -33, -172, 1, -182, -142, -140], [-105, -117, 58, 35, 83]]

A: [80, 1, 83]
****
Q: [[-105, 32, -196, 9, -100, 75], [45, -53], [87, -182, -145, -86, 77, 97, -61], [16, -23]]

A:
[75, 45, 97, 16]
****