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: [[-28, -118, -156, -57, -161], [-29, -157, -63, 77]]

A: [-28, 77]
****
Q: [[-136, 95, 65, -186, 5, 66, -28], [58, -34, -115, -148, 35], [-50, -167, -1, -64, -98, 72], [-169, -19, 99, 25, -55, 93, 37], [80, -153, -95, -95, -179], [62, 89, 79, -200, -13, -171, -153], [-61, -18], [-157, -25]]

A: [95, 58, 72, 99, 80, 89, -18, -25]
****
Q: [[-138, -77, -93, -110, -191], [1, -62, 61], [-149, -11, -35, -125, 84], [55, -123, -17, -121, 18, -66, -79], [-104, 72, -171, -181, -140, -171], [-45, 93]]

A:
[-77, 61, 84, 55, 72, 93]
****