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]: [[-187, -150, -33], [-15, 40, -23, -77, -8, 49], [-40, 11, 37], [-136, -34], [25, 64, 77, 92, -190], [-43, -9, 57, -11, -185, -188, -127], [-58, 19, -27, -64], [51, -46, -19, 72], [-92, -199]]
[EX A]: [-33, 49, 37, -34, 92, 57, 19, 72, -92]

[EX Q]: [[-190, -118, 52], [-118, -139, -176, 7, -164, -105, 8], [23, -133], [-158, 54, -118, -120], [-162, -147], [-154, -102, -134, -142, -141, -127, 61], [25, 7], [-151, -160, -44], [92, -66, -39, -131, -53, -166, 30]]
[EX A]: [52, 8, 23, 54, -147, 61, 25, -44, 92]

[EX Q]: [[28, -85, 76, -117, 50, -49, -22], [-27, -96, 52, -2, -168, -56], [-141, 81], [32, 35, -34, -100, 3, -116], [-30, -139, 97, 41, -159, 17, 5], [-95, 6, -173, 23, -16], [92, 12, 20, -11, -57]]
[EX A]:
[76, 52, 81, 35, 97, 23, 92]