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]: [[75, -154, -179, -44], [-46, 5, -27, -68, -112], [-200, 64, 56, -97, -109, -152, 96], [-129, -77, 58, -70], [29, 93, -138, -195, -141, 72, -181], [-133, -49, -200], [-5, -144, -95, -91, -99], [82, -69], [-195, -120, -86, -177, 30, 22, 92]]
[EX A]: [75, 5, 96, 58, 93, -49, -5, 82, 92]

[EX Q]: [[-134, -117, -108, 57], [-70, 34, 52, -191]]
[EX A]: [57, 52]

[EX Q]: [[44, 80, -193, 39], [90, -8, -77, 76, 91, -100], [41, -111], [-174, 11], [47, 41, -171, -71, -9, 93, -37]]
[EX A]:
[80, 91, 41, 11, 93]