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]: [[-61, -130, -161, 8, -36, 53, -21], [-30, 55, -48, -10, -25, -183, -1], [-92, 93], [-144, -105, -78, 90, -32], [-87, -168, -25, 75, -48, -51, -86], [10, -17, 6]]
[EX A]: [53, 55, 93, 90, 75, 10]

[EX Q]: [[-146, 85], [5, -48, 82, -15, 0, 49], [-179, -123, 95, -154, -193, 2], [-111, -162], [-188, -25, 24], [-112, -147, -165], [65, -191, -134], [-189, 65, 46, -119, -62, -96, -43], [16, 5]]
[EX A]: [85, 82, 95, -111, 24, -112, 65, 65, 16]

[EX Q]: [[89, -25], [44, -111, -152, -42, -3, -33, 84], [-48, -10]]
[EX A]:
[89, 84, -10]