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]: [[-181, -180, 67, -144, 81], [-111, -185, -90, -148], [-57, 8, -160, -124, -144], [-127, 69, -3, -93, -101], [57, -173, 91, -38], [-75, -50, 8, 83]]
[EX A]: [81, -90, 8, 69, 91, 83]

[EX Q]: [[76, -83, -46], [3, 41, -151, -14, -59], [73, 90, -134, 22], [1, -181, -112, -177, 32, -93], [-142, -184, 39, -5]]
[EX A]: [76, 41, 90, 32, 39]

[EX Q]: [[-16, 51, -167, -108, -75], [62, 76], [-175, -32, -36, -10, 21], [-107, 60, 83, -27, -193, -5]]
[EX A]:
[51, 76, 21, 83]