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]: [[-183, 42, 41, 27, -157], [-49, -170, -103, -128], [94, -192], [42, 89], [-73, -107, -134], [5, -23, -9, 4, -151], [-96, -41, -85, -120], [-82, -74, -32, 89]]
[A]: [42, -49, 94, 89, -73, 5, -41, 89]


[Q]: [[-195, 93, 71, -124, 21, -20, 92], [-58, -185, 7, -57, -20, -64], [-19, -117, 60, -165, 31]]
[A]: [93, 7, 60]


[Q]: [[-145, 43, -93, 26, 86, 46], [-31, -65], [92, -194, -178, -124, 90, -104], [-154, 16, 36], [-198, 32, -131, 56, -144], [84, -169, -33, -66, -200, -20], [-77, 98, -117, -156, -200, -9, -185], [-43, 51]]
[A]:
[86, -31, 92, 36, 56, 84, 98, 51]