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]: [[72, -172, -132, 93], [-200, -74, -56, -40, -68, -163, -58], [-72, -164], [-166, -70, -127, -16, -41, -121, 13], [-56, 91], [-181, 35, -12, -99, -122], [-66, 33], [18, -141, -40, 28, -175, -102, -63]]
[EX A]: [93, -40, -72, 13, 91, 35, 33, 28]

[EX Q]: [[36, 35], [-130, -104, -27, 40, 69, -115], [-26, 66, -66, 16], [-23, 79, 51, -13]]
[EX A]: [36, 69, 66, 79]

[EX Q]: [[-41, -63, 51], [-191, -71, 13, -131, -157, -136, -62], [85, -160, 38], [-108, 16, 19, -20], [-118, -39, -186, -119, -114, -14], [-3, -162, -85, -24, 93, 60]]
[EX A]:
[51, 13, 85, 19, -14, 93]