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]: [[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]: [[15, 55, -12, -150, -97, -99], [51, -194, 44], [-80, -77, 61, 83], [13, -197, 61, -137, -41], [-116, -161, -9, -68], [-190, -182, 67, -78], [-69, -122, -119, 15, 12]]
[EX A]: [55, 51, 83, 61, -9, 67, 15]

[EX Q]: [[-115, 21, 25], [-175, -51, -73, -138], [-52, -16, -77], [-180, -19], [-195, 33, -43, -42], [85, -17], [-6, -92]]
[EX A]:
[25, -51, -16, -19, 33, 85, -6]