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]: [[53, -158, -69, 79, -98, -187, 65], [0, -152], [-171, -149, -71, -181, -72, -155], [32, 31, -153], [78, 34, -148, -1, 98, -69], [-157, 26, -9, -200], [-147, 20], [-85, 70, 35, -84, 25, -58]]
[EX A]: [79, 0, -71, 32, 98, 26, 20, 70]

[EX Q]: [[-148, 31, -194, 43, -103, -187, -150], [10, -3, 85, -57], [-102, 39, -179, -125, 49]]
[EX A]: [43, 85, 49]

[EX Q]: [[-159, 71, -199, 61, -110, -151, 13], [-164, -113, -156, -33, -105, -2], [28, -106, -184, -101, -196, -186, -127], [76, -27, -130, -96, -87], [-108, -108, -130, -102, -37, -134], [29, 100, 86], [-147, -185, -99, 64, -77, 24], [72, -85, -179, 98, -86]]
[EX A]:
[71, -2, 28, 76, -37, 100, 64, 98]