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]: [[-16, -54, -63, 93, -162, -89], [68, -135], [96, -48], [94, -86, 22, -98, -95, 31], [81, -15, -150, -108, -34, 29], [-17, 67, 71, 14]]
[A]: [93, 68, 96, 94, 81, 71]


[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]: [[-194, -124, -172, 49, -54, 7, -10], [-78, 30], [38, -78], [-183, -104, 8, -63, -136, -179, 44]]
[A]:
[49, 30, 38, 44]