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]: [[90, -119, -109], [-43, -4, -156, -53], [-76, -171, 18, -56, -146]]
[A]: [90, -4, 18]


[Q]: [[75, -154, -179, -44], [-46, 5, -27, -68, -112], [-200, 64, 56, -97, -109, -152, 96], [-129, -77, 58, -70], [29, 93, -138, -195, -141, 72, -181], [-133, -49, -200], [-5, -144, -95, -91, -99], [82, -69], [-195, -120, -86, -177, 30, 22, 92]]
[A]: [75, 5, 96, 58, 93, -49, -5, 82, 92]


[Q]: [[22, -38, -49, -75, -40, -170], [2, 21], [-9, -101, -45, 24], [-139, -132, 86, -171, -51, -1, 55], [63, -183, -9, -153, 85, -137, -10], [87, -26, -26, -166, -181, -154], [-113, -38]]
[A]:
[22, 21, 24, 86, 85, 87, -38]