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.

[EX Q]: [[-8, 97, -87, -60, -88], [0, -125, 0, 24, -155, -98], [-43, -150], [-196, 79], [-38, 51], [-88, -74, 28, -106, 45, 72]]
[EX A]: [97, 24, -43, 79, 51, 72]

[EX 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]]
[EX A]: [100, -120, -94, 63, 50, -139, 80, 56, 88]

[EX Q]: [[-83, -155, -128, -129, 27, -84, -135], [-66, -87, -104, 75, -34, 74], [-24, -184, -122], [-176, -16, -15, 53, -116, -200], [-151, -115, -38, 43, 72, 49], [36, -109], [-140, -29, -179], [48, -139, -142]]
[EX A]:
[27, 75, -24, 53, 72, 36, -29, 48]