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]: [[-57, -10, -27, -160], [-80, -130, -16, 25], [-65, -106, 30, -104, -20, 77], [-192, -87, -49, 64, 43, 94, 82], [-81, -10, 20, -28, 79, 73, -1], [-191, -83, -113, 40, 6]]
[EX A]: [-10, 25, 77, 94, 79, 40]

[EX Q]: [[55, -93, -37, 78, -196, -158, 53], [-56, -98], [-196, -173, -80], [89, -61, 79, -26, -155], [-157, -161, -158, -112], [-5, -198, -158, -81, 49, -108, 33], [-93, -117, -190, -105], [-71, 91, 87, -117], [-178, -94, -127]]
[EX A]: [78, -56, -80, 89, -112, 49, -93, 91, -94]

[EX Q]: [[-166, 63, 57, -40, 84], [-197, -1, -157]]
[EX A]:
[84, -1]