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]: [[20, 71, -57, -136, 45], [-3, -147, -182], [48, -161, 35, -16, -193], [7, 90, -78, -102], [-108, 92, 30, -147, -86, -132]]
[EX A]: [71, -3, 48, 90, 92]

[EX Q]: [[-192, -183, 27, -64, -73, 59, -30], [-127, -95, 61, -80], [-129, -43, -148, 74]]
[EX A]: [59, 61, 74]

[EX Q]: [[-160, -20, -12, -29], [-114, -46, -127, -3], [-124, -23, -107], [79, -55, 55, -60, 37, -17, 23], [1, -182, -163, -150], [-88, 39, 11, -162], [46, -82, -60, -14, 41, -160, -166]]
[EX A]:
[-12, -3, -23, 79, 1, 39, 46]