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: [[-23, 87, 95, -187, -123], [31, 60, 34, -168], [-29, 31, -37], [-163, -122], [-99, 66], [84, 42, -124, 20, -1], [-4, -190, -150, -150, -49, -20, 17]]

A: [95, 60, 31, -122, 66, 84, 17]
****
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: [[-110, 48, 9, -53, -53, 46], [-143, 68, -158], [-119, -77, -120]]

A:
[48, 68, -77]
****