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]: [[73, -86, -24, -107, 43], [-26, -60, -75, -9, -165], [-134, 87, 97], [100, -87, -94, -163, -189, 87, 85]]
[EX A]: [73, -9, 97, 100]

[EX Q]: [[86, -199], [-148, -11, -34, -90, 76, -18], [-100, -108], [-79, -3, -49, 99, -130, -45], [27, -26, -37, -37, -100, -132, -169], [-160, -115, -48, -107]]
[EX A]: [86, 76, -100, 99, 27, -48]

[EX Q]: [[-41, -158, -149, 22, -174], [38, -28, -12, 37, 32, 34, 88], [-107, -172, 95, -56, -171], [31, 88, -83], [45, 5, -16, -43]]
[EX A]:
[22, 88, 95, 88, 45]