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]: [[-36, -152, -104, -52, 52, 6], [90, -19, -71, -183, -183, -15, -153]]
[EX A]: [52, 90]

[EX Q]: [[-116, -68, 24, -71, 28], [70, 38, 69, 30, -74], [-97, 52], [-110, -129, 63, 50, 44, -11], [-190, -145], [-176, 11, -35]]
[EX A]: [28, 70, 52, 63, -145, 11]

[EX Q]: [[-111, -101, -173, 17, -129, -94, 39], [37, 19, 89], [-90, 92, -175, 35, -183, -50, -36], [15, -160, -85, 55, -46, 23, -130], [-22, -165, -71, -107, 100, -171], [-121, -112, -76], [48, 12, -45, -146, 78, 74, 32], [-3, -179, -1, -86, 52, -23, 34]]
[EX A]:
[39, 89, 92, 55, 100, -76, 78, 52]