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]: [[-8, 97, -87, -60, -88], [0, -125, 0, 24, -155, -98], [-43, -150], [-196, 79], [-38, 51], [-88, -74, 28, -106, 45, 72]]
[EX A]: [97, 24, -43, 79, 51, 72]

[EX Q]: [[-72, -37, -51, 45], [-102, 17, -162, -122, -145], [-40, 31, -71, 89, 92, -3, 16], [-155, -190, 12, 3], [-2, -150, -94, 28, -52, 7], [-150, -106, 8], [-102, -174, -93, -186, -194]]
[EX A]: [45, 17, 92, 12, 28, 8, -93]

[EX Q]: [[90, -9, -3], [-1, 29, -121, 1, -31], [7, -191, -174, -199, -102, -195, -76], [-136, -2, 3, 48, -43, -95, -61], [73, -32]]
[EX A]:
[90, 29, 7, 48, 73]