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]: [[-53, -85, 38, -82, 24, -165], [7, -123, -175, -193, 66, -76, -109]]
[EX A]: [38, 66]

[EX Q]: [[75, -168, -26, -170, -66, 46, -55], [-24, 95, -6], [-138, -147, 53, 1, -161, 70, -180], [7, 68, -48, -112, -121, -178, 44], [100, -87], [-95, -99, -2], [-90, -10, 15, -177, 6, -46], [-78, -99, -136, -41, 20, 32, -187], [-168, 97]]
[EX A]: [75, 95, 70, 68, 100, -2, 15, 32, 97]

[EX Q]: [[-187, -179, -53, 29, -130], [45, -50, -46, -23, 82], [12, -82, 28, -108, 24, -77, -51], [2, -181, 87, -1]]
[EX A]:
[29, 82, 28, 87]