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]: [[-70, -183, -171, 49, -87], [-53, -85, -127, -81], [-62, -55, -77, -17, -96, -186]]
[EX A]: [49, -53, -17]

[EX Q]: [[-71, -181, 24], [-179, -158, -186, 56, -55, -86, 93], [61, -98, -126, -84], [-46, -23, 79, 66, -31, 22, 18]]
[EX A]: [24, 93, 61, 79]

[EX Q]: [[-24, 11, 9], [-180, -112, 84, -43, 21], [-148, -66, -60, -200, 10], [41, -117, 36, 8, 26, -61], [26, 38, -82, -97, -161], [-36, -190], [-21, -84, -173, -94, -26, -78], [2, -106, 84], [-28, -104, 12, -163]]
[EX A]:
[11, 84, 10, 41, 38, -36, -21, 84, 12]