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: [[-94, -23, -131, -75], [94, 72, -29, -30, -63, 86], [42, -62, -33], [34, -167], [-197, 7, -89, -184, 96], [-75, -131, 2, -6, -111, 77, -36], [48, -32, -41, 73], [-178, 60, -5, 39, 40, -27], [-47, -192, -25, -122, -38, -100]]

A: [-23, 94, 42, 34, 96, 77, 73, 60, -25]
****
Q: [[37, -149, 70, -32, -45, -159], [-144, -48], [-19, -130, -128, -154, -55, -183, -44]]

A: [70, -48, -19]
****
Q: [[-107, -74, -68, 35, -107, -24], [74, -34, 64, -63, 14], [-116, -65, 45, -200], [-74, -111, -47, -114, 89, -82], [54, -184, 91, -37, -35], [60, 79], [-30, 70, -7, -25], [-43, 83, -36, 91, -167, -102, -110]]

A:
[35, 74, 45, 89, 91, 79, 70, 91]
****