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]: [[-9, -117, -15, 36, -62, 49, -87], [-169, 79, 48, 59, -122, -181, 2], [-162, 4, 8], [-86, 70, -185, -115, -70]]
[EX A]: [49, 79, 8, 70]

[EX Q]: [[-135, -185], [-37, 19, -24, -175], [-152, -195], [-174, -91, -109, -131], [-159, 22, 12], [-168, -152]]
[EX A]: [-135, 19, -152, -91, 22, -152]

[EX Q]: [[-170, -194, -173, -78, -126, -95], [30, -102], [-113, -190, -42, -186, 83, -46, -51], [-171, -12, -188, -4, -158, 96, -176]]
[EX A]:
[-78, 30, 83, 96]