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]: [[-167, 11, 40, 64], [-136, -48, -90, 19, -124], [54, -157, 3, -24, -62, -92, 84], [-67, -110, -11, -111, 40], [-147, 78, -58]]
[A]: [64, 19, 84, 40, 78]


[Q]: [[-6, -62], [-113, -61, -143, 51, -4, -120, -139], [-158, -24, 22, 71], [98, -148, 36, -108, -144], [-30, -122, -47], [26, 11, -59, -47, -95]]
[A]: [-6, 51, 71, 98, -30, 26]


[Q]: [[-164, -2, 85], [-104, -165, 38, -53, -121, 3, -122], [94, -197, -172, 20, -51, 76, -124]]
[A]:
[85, 38, 94]