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]: [[-122, -18], [-126, -168, -62], [-185, 20, -166, 59, -185, -181, -174], [-32, -105, 14, -182], [91, 95], [-12, -124, 4, -192, -101, -200, -69], [-49, -113, 94, 50], [23, -25], [92, -139, -21, -136]]
[A]: [-18, -62, 59, 14, 95, 4, 94, 23, 92]


[Q]: [[-135, 63, -164, 33], [-23, 2], [26, -11, -148, -153, 29, -2], [-191, 18, -48, -156], [53, -144, 98, 90, 52, 44, -87]]
[A]: [63, 2, 29, 18, 98]


[Q]: [[-30, -29, 76, -170], [-98, -182], [96, -101], [3, -104, -24, 94, -59, 88, 27], [72, -133, -89, 20, 35], [-87, 39, -73, 60, -138, -76, -50], [-23, -87], [-73, 90, -173, -46, -163, 42], [34, 9, -25, 29, 72, -29, -22]]
[A]:
[76, -98, 96, 94, 72, 60, -23, 90, 72]