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: [[-72, -37, -51, 45], [-102, 17, -162, -122, -145], [-40, 31, -71, 89, 92, -3, 16], [-155, -190, 12, 3], [-2, -150, -94, 28, -52, 7], [-150, -106, 8], [-102, -174, -93, -186, -194]]

A: [45, 17, 92, 12, 28, 8, -93]
****
Q: [[-173, -4, 13, -117, 69], [82, -51, -156, 13], [7, 97, 15, -3, -140, -118, -195]]

A: [69, 82, 97]
****
Q: [[-118, -120, -200], [-184, -138, -53, 90, -16], [19, -6, 64, -81, -68, -128], [-13, -96, -14, -98, -86], [35, -59, 50, -70], [87, -146, 89, -163, -197], [-87, 2, -140, -63, -122], [-129, -22], [-132, 68, -14, 46]]

A:
[-118, 90, 64, -13, 50, 89, 2, -22, 68]
****