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]: [[-18, -69, 27, -166, -146, -169], [-11, -183, -102, -104, -33, 65, -19], [-27, -147], [-41, -126, -9, -125], [-28, -26], [-33, -92]]
[A]: [27, 65, -27, -9, -26, -33]


[Q]: [[-118, -195, 73, 55, -149], [-113, 12, -48, -35, 85], [-17, 81, 89, -78, -105, -40], [67, -188], [-125, -69], [45, 75, -35, -187, 79, 19, 90], [46, -20, -22, -191, 51, 63]]
[A]:
[73, 85, 89, 67, -69, 90, 63]


