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]: [[58, -59, 67, 49, -141, -53], [90, -175, -119, -145, -172, 72, -40]]
[A]: [67, 90]


[Q]: [[100, 3, -8, -15, -181, 25, -122], [-183, -120], [-95, -183, -94], [-34, -100, -172, 63, -139, -136], [-175, -113, -104, 50], [-170, -139], [-159, 80, 29, -100, -142, -108, -36], [56, -11], [-120, -109, -28, 88, -145, -92]]
[A]: [100, -120, -94, 63, 50, -139, 80, 56, 88]


[Q]: [[-54, 91], [-26, 8, -108, -7, 35, -38, -193], [-47, 43, -12, -125], [-188, -26]]
[A]:
[91, 35, 43, -26]