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]: [[13, 57, -9, -14], [-52, -50], [-53, 99, -145, 13, 32], [-195, -147, -179, 6, 67], [-189, 54, -1, -111], [-152, -12, -169, 62], [-4, -134, -18, 7, -134, -66, -23]]
[EX A]: [57, -50, 99, 67, 54, 62, 7]

[EX Q]: [[5, -173, -51, 56, 31, -94], [-140, 27, -21, -163, -4, -146, 40], [67, -177, -122]]
[EX A]:
[56, 40, 67]