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]: [[79, 50], [90, 81, -105]]
[A]: [79, 90]


[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]: [[-6, 49], [91, -28, 69, 94, -90], [19, -51, -22, 59, -164, 84, -120], [-84, -86, 74], [60, 52, -35, -182, -163, 13], [-26, -133, -18], [52, -87, -118, -185], [-136, -54, -89, 89, 31, -90, -32]]
[A]:
[49, 94, 84, 74, 60, -18, 52, 89]