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]: [[25, 21, -174, -186, -91], [32, -27], [79, 21, -128, -14, -41, 14, 86], [-72, 87, 96], [-44, -33, -173], [-33, 84, -92, -109, -135, -177, -5], [-1, 93, -162, 81, 8]]
[A]: [25, 32, 86, 96, -33, 84, 93]


[Q]: [[-89, -60], [75, -56]]
[A]: [-60, 75]


[Q]: [[-122, -162, 79, 9, 98, 42, 4], [-13, -200, 22], [-6, -186, -152], [-176, 99, 13, -151, 26, -98, -103], [-92, -61, -20, -49, -180, -14, -107], [-21, 54], [49, -47], [-186, 64, -69, -16, -75], [-158, 32, 10, -25, -171]]
[A]:
[98, 22, -6, 99, -14, 54, 49, 64, 32]