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]: [[-136, 45], [-57, 33], [-22, -147, -103, -96, 26], [69, -200], [-173, -190, 89, 86], [-27, -54, -152, -159, 10, 95], [-179, 47, 10, 57], [-95, -4, -108, -97, -131, -150, -119]]
[EX A]: [45, 33, 26, 69, 89, 95, 57, -4]

[EX Q]: [[-29, -11, 24], [48, -176], [-159, -49, -55, -186, 2, -143, -199], [-91, -164, -58, 1, -28], [-28, -18, -53, -63, -145, 18, -19]]
[EX A]: [24, 48, 2, 1, 18]

[EX Q]: [[-72, 32, 95], [-85, -149, 16, -57, -153, -57, -68], [29, -174], [28, -34, -2, 88]]
[EX A]:
[95, 16, 29, 88]