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]: [[-123, -64, -37, -55], [-170, -193, 73, 94], [-21, -159, -100], [-59, -193, -156, 76], [21, -147, -140, -165, 85, -14], [-51, 57, 85, 1, -69, 93], [-156, -17, 72], [-48, -165, -96, -148, 5, -147], [-81, -55, 87, -12, -9]]
[EX A]: [-37, 94, -21, 76, 85, 93, 72, 5, 87]

[EX Q]: [[-138, 20, 9, -133, -166, -153], [-71, -103], [-144, 9, -15, 2, -17, -172, -139], [97, -35, 16], [-77, -46, 46, -41, -12], [-166, -84, -193, 17, 12, -142], [-76, 90, -186]]
[EX A]: [20, -71, 9, 97, 46, 17, 90]

[EX Q]: [[-48, -55, -134, -87], [-161, 95, 93, 5, -110, 92, 77], [9, -129, -58, -169, -190], [-54, -73, -95, -128, -92, -36, -124], [30, 55, -55, 59, 10, 76], [-192, -64, 13, 24], [-7, 89, 65, 37], [55, 62, 99, 91, 80, 62, -140]]
[EX A]:
[-48, 95, 9, -36, 76, 24, 89, 99]