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]: [[10, -121, -54, -1, -69, -181], [83, -37, -173, -81, -42], [-117, 86, -6, -54, -21], [-171, 22, -69]]
[EX A]: [10, 83, 86, 22]

[EX Q]: [[53, -158, -69, 79, -98, -187, 65], [0, -152], [-171, -149, -71, -181, -72, -155], [32, 31, -153], [78, 34, -148, -1, 98, -69], [-157, 26, -9, -200], [-147, 20], [-85, 70, 35, -84, 25, -58]]
[EX A]: [79, 0, -71, 32, 98, 26, 20, 70]

[EX Q]: [[-71, -64, -90, 99, -96], [-192, -5, 100, -185, -157, -7], [-160, 15, -112, -133, -99, 71]]
[EX A]:
[99, 100, 71]