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]: [[5, -85, -188], [44, -175, 17, 82, 16], [-91, -101], [-172, -71, -147], [-90, 46, -27, 25, -122], [-23, -83], [-70, -18, 68, -98, -130, -177, -131]]
[EX A]: [5, 82, -91, -71, 46, -23, 68]

[EX Q]: [[-170, 59, -185, 48, -2], [28, -146, 46, -149, -2, -139], [-199, -109, -140, -197, -122, -61], [23, -189, 0, -57], [100, 70, -115, -37, -66, -184], [-14, 29, -190, -135, 95], [98, -11], [-157, -97, 25, 59, 22, 36], [-10, 70, -110]]
[EX A]:
[59, 46, -61, 23, 100, 95, 98, 59, 70]