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]: [[54, 83, -51, -150, -2, -16, -46], [-55, 91, -47, -111], [-31, 46, -124, -178, 21, -17, -72], [53, -71], [-122, -122, -119, -33, 6, 29], [-42, 77, 27, -38, -20], [22, -22, -81, -136, 52, -50, -125], [-119, -115, -194, -102, -200, -68, -186], [-33, -105, -155]]
[A]: [83, 91, 46, 53, 29, 77, 52, -68, -33]


[Q]: [[-14, -150, -93, 55, -98, 54, -132], [-132, -64, -152, -37, -15], [-130, -137, -25, -40, -15, -165, 19], [-45, -121, -64, 99, -19], [-158, -6, -199, 91, -106], [-149, -111, 85, -94, 43, -185, -23]]
[A]: [55, -15, 19, 99, 91, 85]


[Q]: [[-113, -9, -7, 31, -164, -68], [-166, 2, -16], [26, -78, 92], [95, -33, 74]]
[A]:
[31, 2, 92, 95]