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]: [[-95, 0, -192, 42, -97, -175, 46], [-35, -75, 40, 81], [8, 80, -20, -159, -36, -128, 96], [3, -193], [-35, -13, -69, -2], [11, 89, -183, -49], [-67, -184], [-164, -183, -107, 77]]
[A]: [46, 81, 96, 3, -2, 89, -67, 77]


[Q]: [[-199, 11, -198, 9, -12, -184, 55], [-71, 17, -44, 64], [-144, -165, 40, 56, -179], [-151, -162, -94, -31], [-58, -4, -47, -69, -6, -168, -24], [51, -144]]
[A]: [55, 64, 56, -31, -4, 51]


[Q]: [[-94, -200, 15], [-95, -132, 94, -48], [-150, -148, 81, -28, -129, -189, -138], [-8, -18, -15, -96], [52, -67, -74], [-95, -109, -47, 29, -144, -137, -140]]
[A]:
[15, 94, 81, -8, 52, 29]