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]: [[-27, -95, -24, 21, -4], [-82, 46, 70, -26, -123, 20], [49, -103, 64], [-107, -168, 6, 38, -46], [-180, -187, 64], [-105, -27]]
[EX A]: [21, 70, 64, 38, 64, -27]

[EX Q]: [[-117, -191, 74, -91, 71], [-175, -177], [67, 65, -160], [-98, -28, -119, -66, 29, 7, -106], [-7, -132, -151], [-139, -163, -10, 40, 81]]
[EX A]: [74, -175, 67, 29, -7, 81]

[EX Q]: [[38, 0, -6, 94, -117, -85], [-29, -183, -136], [45, -175], [-185, -98, -117, -190, 64, -172, -58], [-142, -114, 10, -37, 36, -174, 66], [-195, -185, 33], [-23, -176, -108], [53, 56, 21], [12, -161, -24, 15]]
[EX A]:
[94, -29, 45, 64, 66, 33, -23, 56, 15]