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]: [[-61, 31, -135, 15, -167, 30], [-1, -18], [65, 41, -43, -165, -28, -135], [-15, -117], [-38, -151], [12, 59, -5, -79, -104, -109, -93], [-66, -61, -171, -23]]
[EX A]: [31, -1, 65, -15, -38, 59, -23]

[EX Q]: [[-24, 92, -135, -45, -58, 69], [-171, -28], [-40, -44, 82, 82, 98], [-153, -155, -64, 72, -59, -39, -25], [-167, -30, -48, 23, 4, -6]]
[EX A]: [92, -28, 98, 72, 23]

[EX Q]: [[-98, 32, -124, 10], [-60, -76, -99, -99], [-33, -139, -184, 19, -136], [84, -156, -38, -32, -19, 67, -130], [-181, 83, -3, -131, -81, -200], [-192, 27], [-125, 5, -37], [0, -183, -161, -143, -175, -89]]
[EX A]:
[32, -60, 19, 84, 83, 27, 5, 0]