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]: [[50, -99, 52, -39, -139, 57, -66], [-50, 61, -23, -169, -153, -162, -81], [-165, -194, 36, -100, -200, -81], [-83, 78, -200, -49, -96]]
[EX A]: [57, 61, 36, 78]

[EX Q]: [[-184, -18], [62, -135, 95, -110, -70], [-168, 50, 26], [-45, -110, 81, -45, -191, -146, -88], [-95, -71, -90, -174, 49], [-32, 91, -141], [-150, 13, -90, 4, -75, 94], [31, 59]]
[EX A]: [-18, 95, 50, 81, 49, 91, 94, 59]

[EX Q]: [[-138, -173], [-101, -53, -70, 74, -58, -45, 33], [49, -168, -95, -96, -110], [-141, 13, -92, -62], [-25, 7, -155, 25, -112, -188, -34], [-50, -93, -121, 38, 38], [-46, -186, 42, -160, -146, -140], [8, -143, -107, -6, -105, -2, 35], [21, -40, -144, 72]]
[EX A]:
[-138, 74, 49, 13, 25, 38, 42, 35, 72]