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]: [[91, -82, -158, -188], [-148, -168, 25, 53], [-87, 82], [-176, -136, -24, -72, -9, -12]]
[A]: [91, 53, 82, -9]


[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]: [[-1, -18], [-155, -34, -196, 28, 26, -160, 84], [-41, 33, 67, -58], [-176, -106, -54, -93]]
[A]:
[-1, 84, 67, -54]