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]: [[-26, -118, -136, -177, -61, -195, -191], [-118, -3, -34, -155, -125]]
[EX A]: [-26, -3]

[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]: [[-138, -84, -128], [86, 86], [3, 16, 12, 16, 62, -25, -130], [-128, -140, -44], [-24, -38, 92, -70, -104, -102, 50], [-153, -9, -152], [93, -198, -16, 28], [39, -93, 10, -48, 42, -118, -33], [-81, 36, 10]]
[EX A]:
[-84, 86, 62, -44, 92, -9, 93, 42, 36]