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]: [[-138, 71, -27, -83], [-80, -136, 28, 70], [33, -23, -79, -51, -127]]
[EX A]: [71, 70, 33]

[EX Q]: [[-20, -163, -126, -26], [-7, -183], [1, 84, 39, -79, -79, -98], [13, 2, -5, 20, 98, 30, -4]]
[EX A]: [-20, -7, 84, 98]

[EX Q]: [[-145, -24], [-180, -77, 79], [-138, 47, 16, -162, -183, 35], [-40, -190, 43, 56, -112, 20], [-10, 16, -200, -197, 0], [-120, 61, 5, 82, 26, -183], [12, 45, -131, -116, -92, 86, -69], [-177, -139, -104, 48, -191], [45, -122, 73, -117, 62]]
[EX A]:
[-24, 79, 47, 56, 16, 82, 86, 48, 73]