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: [[-15, 18, 88, 39, -96], [-65, -76, 85, 2, -58], [41, -103], [-15, -196, -94, 13], [-57, 25, -169, -18, 42, -114], [-131, -61, 20, 42, -92, -50], [-93, -35], [-22, -200, -74, 17, -67, -17]]

A: [88, 85, 41, 13, 42, 42, -35, 17]
****
Q: [[7, 12], [-173, 15, -64, -64, -10, 54], [87, 73, -93, -48, -75, -135]]

A: [12, 54, 87]
****
Q: [[-95, 46, -131], [-83, 15, 26, 46, -140, -58, 12]]

A:
[46, 46]
****