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]: [[-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]: [[-70, -183, -171, 49, -87], [-53, -85, -127, -81], [-62, -55, -77, -17, -96, -186]]
[A]: [49, -53, -17]


[Q]: [[-26, -54], [-116, -106, -74, -178], [-99, -53], [-13, -170, -100, -168], [-59, -42, -74, -90], [-43, -119, -36, 81, -193], [-110, -7, -55, -73, 21, -105]]
[A]:
[-26, -74, -53, -13, -42, 81, 21]