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]: [[38, 37, -11], [-101, 80, -9, -10], [94, -94, -113, -46, 37, -91, -147], [-58, 31, -157]]
[EX A]: [38, 80, 94, 31]

[EX Q]: [[79, 50], [90, 81, -105]]
[EX A]: [79, 90]

[EX Q]: [[-31, -106, 76, -171, -165, -155, -65], [21, 29, 48, -139, -113, 8], [-176, -150, -27, -54, -72, -102, 29], [-65, -198, -113, -18, -198, 86, 98]]
[EX A]:
[76, 48, 29, 98]