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]: [[-92, 82], [-90, 37], [-135, -183], [-140, 37], [-156, -132, -162, -185], [28, 67, -110, -50, -53]]
[EX A]: [82, 37, -135, 37, -132, 67]

[EX Q]: [[-179, -61], [-68, -169, -177], [-103, -165], [-12, 40, -44, 97]]
[EX A]: [-61, -68, -103, 97]

[EX Q]: [[50, -48], [24, -61, -146, 41, -40], [-175, -23, 79], [-43, -164, -10, 41], [37, -27], [92, -172, -158, -110, 57], [49, -3, 13, -113], [-72, -155, -23, -119, 46, -200, 66]]
[EX A]:
[50, 41, 79, 41, 37, 92, 49, 66]