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: [[-187, -150, -33], [-15, 40, -23, -77, -8, 49], [-40, 11, 37], [-136, -34], [25, 64, 77, 92, -190], [-43, -9, 57, -11, -185, -188, -127], [-58, 19, -27, -64], [51, -46, -19, 72], [-92, -199]]

A: [-33, 49, 37, -34, 92, 57, 19, 72, -92]
****
Q: [[-120, -84], [10, 74, -15, -153]]

A: [-84, 74]
****
Q: [[33, -102, -126], [19, -121, -5, -173, -65], [-71, -73, 92, -129], [-6, 56, 37, 13]]

A:
[33, 19, 92, 56]
****