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]: [[-191, 84, -188], [58, -44, -167, -105, 37], [-92, -44, 3, 23, 26, 37], [-107, -65, 55, 81], [-32, 58], [31, -25, -80, -152, -111, -154, -147], [-166, -135]]
[A]: [84, 58, 37, 81, 58, 31, -135]


[Q]: [[-101, -84, 47, -147], [-117, -82, -152, -159, 40]]
[A]: [47, 40]


[Q]: [[-127, -61, 28, -143, -131], [-13, -166, -181, -120, -189, -55, -171], [99, 3, -183, -89, -102], [-69, -149], [-126, 54, -129, 36, -14, -54, 55], [53, -168, -2, 44], [38, -76, -153, 81], [-121, 27, -161, -193, 8]]
[A]:
[28, -13, 99, -69, 55, 53, 81, 27]