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]: [[53, -34, -71, -43, -141, -174, -73], [5, -80, -181, -140, -63, -86, 34], [-86, -1, 91, 15, -191], [-171, 1, -62, 9, -161, 40, 35]]
[EX A]: [53, 34, 91, 40]

[EX Q]: [[75, -168, -26, -170, -66, 46, -55], [-24, 95, -6], [-138, -147, 53, 1, -161, 70, -180], [7, 68, -48, -112, -121, -178, 44], [100, -87], [-95, -99, -2], [-90, -10, 15, -177, 6, -46], [-78, -99, -136, -41, 20, 32, -187], [-168, 97]]
[EX A]: [75, 95, 70, 68, 100, -2, 15, 32, 97]

[EX Q]: [[77, -189, 12, 13], [-200, 95, -40, 86, 35, -199, 43], [11, -2, -4], [25, 53], [-172, -188, -22, 86, -149], [37, 34, -133, -184, -32, 60, -136], [-52, -139], [-18, 79, 67], [-56, -194, -17, -157, -10, -32, -65]]
[EX A]:
[77, 95, 11, 53, 86, 60, -52, 79, -10]