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]: [[-20, -187], [-50, -191], [-69, -155, -10, -152, -72, 86], [53, -172, -84, 95]]
[A]: [-20, -50, 86, 95]


[Q]: [[-26, 54, 36], [-50, 30, -14], [-156, -199, 52, -83, 10], [-97, -59], [-14, 5, -188, -55, 74, -190], [43, -5, 14, 28, -77, -186, -74], [-200, -151], [-162, 64]]
[A]: [54, 30, 52, -59, 74, 43, -151, 64]


[Q]: [[-70, -109], [-45, 18, -30, -171, -192], [-175, -162, 98, 22], [52, -141, -45, -158], [-46, -173, -35], [67, 84, 77], [-165, 83, 13], [-180, 75], [-36, 14]]
[A]:
[-70, 18, 98, 52, -35, 84, 83, 75, 14]