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]: [[-1, 80, -4, 63], [-191, -139, 22, 31, -145], [-154, -165, 43, -190]]
[A]: [80, 31, 43]


[Q]: [[-29, -11, 24], [48, -176], [-159, -49, -55, -186, 2, -143, -199], [-91, -164, -58, 1, -28], [-28, -18, -53, -63, -145, 18, -19]]
[A]: [24, 48, 2, 1, 18]


[Q]: [[38, 44, 43, -129, -140, -190, 48], [-164, 83], [77, -197, -133, 23, -140], [75, -113], [-140, -154, -70, -14, -60, -87, -57], [-137, 73, -26, -56, -156, -88], [-50, -26, 23, -36, -157, -51], [-25, 30, -177]]
[A]:
[48, 83, 77, 75, -14, 73, 23, 30]