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: [[-110, -173], [12, 37, -136, -70, -108], [-114, 0, -48, -74], [24, -48, -112, -166, -21, -28]]

A: [-110, 37, 0, 24]
****
Q: [[-79, -29, 95, 11, -47, -37], [-61, -14, 2, 63, 18, -44, 60], [67, -61, -152, -108, -184, 85], [-7, -135, -113, -81, -146, -34], [74, 58], [-139, 40, -181, -95], [83, -28, -200], [80, -130, -174, 36, 19], [12, 70, -198, -62]]

A: [95, 63, 85, -7, 74, 40, 83, 80, 70]
****
Q: [[-84, -170, 56], [0, -57, -160, -28, -137, 43, -117], [-54, -61], [-198, 96, 26, -100], [-164, -134, -181, -91, -193, -82, 19]]

A:
[56, 43, -54, 96, 19]
****