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]: [[9, -188, -167, -47], [-72, -97, -152, -108, -49, -5], [-88, -84, 26, -11, -91, -46, 62], [-110, -35, -61, -141, -182], [52, 29, 92, -131, -121, -98, -35], [-30, -125, -175, -123, -45], [91, -16, -57]]
[A]: [9, -5, 62, -35, 92, -30, 91]


[Q]: [[-149, 97, 37, -156], [-179, -55, -35, -109], [-64, -190, 7, -6, -4, -96, -149]]
[A]: [97, -35, 7]


[Q]: [[39, -179, 55, -3, -167], [-89, -47, -96], [-156, -90, 69]]
[A]:
[55, -47, 69]