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]: [[36, 35], [-130, -104, -27, 40, 69, -115], [-26, 66, -66, 16], [-23, 79, 51, -13]]
[A]: [36, 69, 66, 79]


[Q]: [[-161, -49, -6], [36, -84], [-53, 29, 2, -167, -111], [-163, -46], [-41, -91], [-71, 29, 35, -187, -53, -196, -66]]
[A]: [-6, 36, 29, -46, -41, 35]


[Q]: [[-150, 46, 0], [42, -91], [-76, -22, 21], [11, 13, -25, -12]]
[A]:
[46, 42, 21, 13]