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]: [[-56, 1, 91, 72, -43, 93, 97], [82, -37, 68, 90, -1], [-77, -107, -45, -85, 93], [48, -60, -115, -121, 52, -56, -173], [-75, -154, 52, -51, -70], [-133, -87, -29, -183, -168], [37, -115, -149, -51], [-168, -135, 79], [-46, 13, 24, -91, -91, 80]]
[EX A]: [97, 90, 93, 52, 52, -29, 37, 79, 80]

[EX Q]: [[29, -177, 85, -139, 29, -19], [-11, 17, -113, -1, -1], [-41, -53, -56, -10], [64, 98, -176, -191]]
[EX A]:
[85, 17, -10, 98]