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]: [[37, 63, 24, -49, -66, 81], [-36, -61, -108], [35, -115], [-24, -143, 65, -63], [-104, 59, -120, -187, 27, -102, 36], [-105, -31, -128, -167, -109], [32, -148, -76, 33, -190, -89], [47, -56, 89, -35, -137, -2, 43], [98, 11, 48, -66, -84, -60]]
[EX A]: [81, -36, 35, 65, 59, -31, 33, 89, 98]

[EX Q]: [[-190, -118, 52], [-118, -139, -176, 7, -164, -105, 8], [23, -133], [-158, 54, -118, -120], [-162, -147], [-154, -102, -134, -142, -141, -127, 61], [25, 7], [-151, -160, -44], [92, -66, -39, -131, -53, -166, 30]]
[EX A]: [52, 8, 23, 54, -147, 61, 25, -44, 92]

[EX Q]: [[-25, 24, 55], [-27, 63, -77, 45, -113, 29, 26], [36, 88, -130, -55], [24, -141], [49, -176, -183, 85, -121], [-74, -164, -168, -172, 82]]
[EX A]:
[55, 63, 88, 24, 85, 82]