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, 10, -181, -96], [-40, 69, 46, -116, 53], [-135, 92], [-151, 35, -65, 52], [23, -125, 82, 57, -57], [-185, -94, -73, -131, -191, 70, -154], [9, 65, 41]]

A: [51, 69, 92, 52, 82, 70, 65]
****
Q: [[-71, -181, 24], [-179, -158, -186, 56, -55, -86, 93], [61, -98, -126, -84], [-46, -23, 79, 66, -31, 22, 18]]

A: [24, 93, 61, 79]
****
Q: [[-193, -112, 24, -133], [-104, -145], [-156, -17, -78], [-54, -92, -106, 5, -151, -123], [-119, 54, -100, 65, -77, -184]]

A:
[24, -104, -17, 5, 65]
****