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]: [[-94, -23, -131, -75], [94, 72, -29, -30, -63, 86], [42, -62, -33], [34, -167], [-197, 7, -89, -184, 96], [-75, -131, 2, -6, -111, 77, -36], [48, -32, -41, 73], [-178, 60, -5, 39, 40, -27], [-47, -192, -25, -122, -38, -100]]
[A]: [-23, 94, 42, 34, 96, 77, 73, 60, -25]


[Q]: [[-103, -43, 55, 15, -19], [21, -7, -107, -40, -189], [-111, 75, 73, -198, -190], [-135, 82, -144, -32, 84, -98]]
[A]: [55, 21, 75, 84]


[Q]: [[99, -50, -59, 48, -134, -18], [-102, -128], [97, -56, -71, 41, -169], [41, -171]]
[A]:
[99, -102, 97, 41]