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]: [[-51, -92, -181, -134, 56, -85], [-87, -90, -147], [97, -178, -18, -191, -55, -164], [5, -145], [37, 67, 75, -112, -191, 34], [100, 17], [-165, 4, 39, -184, -136], [-94, 22, -33, 24, -13, 38]]
[A]: [56, -87, 97, 5, 75, 100, 39, 38]


[Q]: [[50, -128, 17, 76, -122, 50], [6, -23, -7, -120, 28, -26], [-16, -60, -152], [28, -111, 22, -26, -61, -141, -16], [-51, 74]]
[A]: [76, 28, -16, 28, 74]


[Q]: [[-2, -198, -55, -125], [48, -116], [-50, -147, 69, -199], [34, -69, -148, 69, -18], [-73, -196, -150, -181, -33, -11, -74], [-167, -47, -20, -163, -70]]
[A]:
[-2, 48, 69, 69, -11, -20]