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]: [[98, -129, 10], [-55, -168, -73, -44, -68], [-177, 91, 98, 7, -39, 85], [-26, -129, -100, 19], [-154, -80, -1], [50, -171, 3], [49, -164, 98, -108, 9, -18, -176], [-81, -17], [-30, 48, -122, -134]]
[EX A]: [98, -44, 98, 19, -1, 50, 98, -17, 48]

[EX Q]: [[-194, -53], [76, -105, -182, -135, -156, -156], [22, -167, -59], [95, -6, -181], [97, 39, 52, -123, -64, 33, -137], [85, 38, -56, 59, -63], [22, -26, 13, -39], [-118, -51, 91], [24, 99, 93, -169, 80, 46]]
[EX A]: [-53, 76, 22, 95, 97, 85, 22, 91, 99]

[EX Q]: [[38, 37, -11], [-101, 80, -9, -10], [94, -94, -113, -46, 37, -91, -147], [-58, 31, -157]]
[EX A]:
[38, 80, 94, 31]