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]: [[-117, -110, 36, 18], [-15, 40, -140], [-33, 79, 8, 42, -4, 84]]
[EX A]: [36, 40, 84]

[EX Q]: [[91, -34, 63], [10, -130, 82, 21, 45], [-115, 18, -41, -36, -96], [-147, 46, -124, -139], [-173, -23, 37, -171, -65, -21, -42], [-191, -172, -147, 17, -27, -124], [19, 46], [-46, -174, 74]]
[EX A]: [91, 82, 18, 46, 37, 17, 46, 74]

[EX Q]: [[13, 92, -187], [-100, 5, -189, 85, 16, -154], [-37, -115, -78, 38, 77, 100], [-199, -25, -65], [74, -83, 47], [4, -123, -29, 39, 37, 6], [72, -88, 68, -85]]
[EX A]:
[92, 85, 100, -25, 74, 39, 72]