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]: [[-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]: [[-135, 63, -164, 33], [-23, 2], [26, -11, -148, -153, 29, -2], [-191, 18, -48, -156], [53, -144, 98, 90, 52, 44, -87]]
[EX A]: [63, 2, 29, 18, 98]

[EX Q]: [[-191, 79, 37], [-49, -164, 85, 54], [-64, -29], [-42, 71], [-16, -82, -73], [-111, 14, -171, 4, -198, -131, 2], [-117, -106, -72, -3]]
[EX A]:
[79, 85, -29, 71, -16, 14, -3]