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]: [[51, -67, -81, -30, 67, -10, -110], [-187, 85], [-127, -137, -194, 90, -185, -149, -163], [-54, -34, -105, -77, -65, 76], [-121, 81, -112, -28], [-65, 97, 98], [8, -183, 72, -81, 15, 94, 32]]
[EX A]: [67, 85, 90, 76, 81, 98, 94]

[EX Q]: [[-150, 36, 40, 48, 65, -46, -72], [-130, 65], [37, -87], [-199, 63, -64], [-114, -44, -115, -192, -12, 73]]
[EX A]:
[65, 65, 37, 63, 73]