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]: [[-173, -53, -182, -135, -193, -186], [-160, -98, -103], [17, -38, 36, -50, -36]]
[EX A]: [-53, -98, 36]

[EX Q]: [[44, 44, 75, -181, 49, -30], [-102, -76, -66, 57, -83, -162], [-40, -167, 21, -29, 75, -195], [20, -158], [-125, -95], [8, -148, -4, 20, 9, -188, -157]]
[EX A]: [75, 57, 75, 20, -95, 20]

[EX Q]: [[51, -62, -122, -177], [30, -171, -37, -118, -112]]
[EX A]:
[51, 30]