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.

[Q]: [[-27, -28, 59, -2, -90, 50, -81], [9, 83, -62, 32]]
[A]: [59, 83]


[Q]: [[-20, -187], [-50, -191], [-69, -155, -10, -152, -72, 86], [53, -172, -84, 95]]
[A]: [-20, -50, 86, 95]


[Q]: [[-199, -70, -108, 9, -54], [89, 74], [-46, -49, -117, -14], [-164, -194, -121, -196, -65, -166], [31, -193], [-165, -149, -122, 22, -173, -199, 79], [-47, 29, 43, 43], [29, 23, -200]]
[A]:
[9, 89, -14, -65, 31, 79, 43, 29]