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]: [[-190, 12, -59, 9, 100, 83], [-187, 40, 97, 8, -29], [77, -190], [-153, 11], [17, -89, -75, 52, -112, -52, 51], [-60, -103, -79, 74], [-86, -4, 55, 99], [-69, -25, -52], [8, -62]]
[EX A]: [100, 97, 77, 11, 52, 74, 99, -25, 8]

[EX Q]: [[-6, 41, -190], [-47, 89], [29, -17, -135]]
[EX A]: [41, 89, 29]

[EX Q]: [[37, -89, -196], [-71, -59, -3, -1, 79], [-23, 55, 35, -172, -93], [-36, 91, -90, -120], [-136, -107], [-108, 20, -160, -87, -162, -165, -145], [-169, -83], [-87, -83, -165]]
[EX A]:
[37, 79, 55, 91, -107, 20, -83, -83]