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]: [[-184, -93, -128, -153], [50, -104], [21, -156, -185, 27, 32, -187, -132]]
[A]: [-93, 50, 32]


[Q]: [[-53, 27, -29, 53, -93], [-148, -197]]
[A]: [53, -148]


[Q]: [[-49, 93, -123, -128, -61, -79, 48], [-200, -102, -8, -43, -111], [0, 22], [-149, -197], [-19, -184, 55, 80, -145, -126], [25, -60, 86, 97, 59, 63, -134], [-182, -2, -39, -125, -151]]
[A]:
[93, -8, 22, -149, 80, 97, -2]