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]: [[18, -95, -165, -171, -117], [62, -61, -196, -59, 84], [-83, -159], [-11, -65, -188, -27, 96, 88, -70], [-136, -91, -52], [-6, -118, 90, -192], [-179, 36, 76]]
[EX A]: [18, 84, -83, 96, -52, 90, 76]

[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]: [[-11, 87, 64, -200], [50, -10, -199, -39, -43, -176, -126]]
[EX A]:
[87, 50]