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]: [[-150, 25, -177, 29, 1], [85, 82, -6, -151, -93, -182], [-181, 99, 32, 16, -116, 89], [-29, -186, -40, -7, -64, -29, -33], [-27, -68, -126], [-77, -3, -144]]
[A]: [29, 85, 99, -7, -27, -3]


[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]: [[-141, -171, 0, -32, -138, 1], [-98, -139, -81, -86, -101, -24, -168], [97, -142], [-79, 89, -187, 38, -134, -51, -114], [56, 44, -63, 69, -155], [-97, 67, 26, 6]]
[A]:
[1, -24, 97, 89, 69, 67]