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: [[-43, 91, -9], [-92, -49, -69, -88, -200], [89, -39, -15, 43], [-52, 83], [39, -91, -113, 92], [-106, -91, -112, -149]]

A: [91, -49, 89, 83, 92, -91]
****
Q: [[-12, -101, -7, 46, 65, 60], [75, -187, -156], [21, -196], [-172, -42, -137, -90, 82, -85, 10], [4, -48, -50], [-3, -132], [-54, -23, 21]]

A: [65, 75, 21, 82, 4, -3, 21]
****
Q: [[-56, -11, -54, -65], [-150, 54, -14, 17], [-153, -14, 56, -8, -14], [-180, -92], [73, -169, -170, -130, 16], [-23, -154, -177, -129]]

A:
[-11, 54, 56, -92, 73, -23]
****