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]: [[70, -85, -168, -181, -49, -105], [-178, -54, -86, -113, -16], [1, 51, -127, -18], [-61, 80, -64], [-45, -175, -125], [-138, -96, -112, -14, -77, -188], [84, -96, 32, -165], [-125, -42, 88, 4, 60, -122, 89], [49, -84]]
[A]: [70, -16, 51, 80, -45, -14, 84, 89, 49]


[Q]: [[4, -119, -5, 16, -97], [-189, 64, 89, 8]]
[A]: [16, 89]


[Q]: [[93, 38, -28, -161, -127, -167], [47, -53, 68, -92], [-172, -88, -130], [-141, -73, 83], [-163, -62, 45, 43, -126, -146, -41], [-44, -38, -138, 35, -104, 95, -76], [36, -200, 30, -1, -31, -54, -133], [55, -35, -140]]
[A]:
[93, 68, -88, 83, 45, 95, 36, 55]