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]: [[-42, -87], [-101, -39, -128, 73, -16], [85, -168], [-166, -107, -135, -139, -35, 76]]
[EX A]: [-42, 73, 85, 76]

[EX Q]: [[-71, -181, 24], [-179, -158, -186, 56, -55, -86, 93], [61, -98, -126, -84], [-46, -23, 79, 66, -31, 22, 18]]
[EX A]: [24, 93, 61, 79]

[EX Q]: [[-171, -129, 53, -139, 65, 100, -86], [-89, -68, -158, 66, -151, -165, -61], [-124, -112, -98, 91, -141], [-64, 53, 94, -111, 52, 68, -54], [-21, 27, -106, -104], [-118, -43, 69], [-145, -45], [28, -169, -133], [-180, -74, -40, 2, 33, 68]]
[EX A]:
[100, 66, 91, 94, 27, 69, -45, 28, 68]