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: [[77, 41, -119, -94, -64], [-129, 98], [57, -199, -120, 23, 55, -62], [-76, 55, -37, -164, 95, 75, -120], [-149, -121, -123, -133, -136, 68]]

A: [77, 98, 57, 95, 68]
****
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: [[-87, 6, 99, -141, 35, -95], [-199, -85, -200, -176, 83, -125, -27], [91, -71, -111, -190, -125, 47], [72, 24, 96, 74, -74, -147]]

A:
[99, 83, 91, 96]
****