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]: [[-179, -61], [-68, -169, -177], [-103, -165], [-12, 40, -44, 97]]
[EX A]: [-61, -68, -103, 97]

[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]: [[-158, -20, -68], [83, -102, -108, 17, 87], [43, -137, -175, -125, 59], [-51, -62, 57, 88], [-78, -139, 58], [-12, 19, -130, -23, 91, -120, -85], [4, 69, -117, -41, 48], [-59, -161], [-116, -196, 41, -178, -122, -20]]
[EX A]:
[-20, 87, 59, 88, 58, 91, 69, -59, 41]