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]: [[52, -128, -179, -149, 20, -143], [-174, -30, -84, -103, 39, -123, -85], [-52, 86, -77, 10, 58, -150, 95], [-165, -32, -190, -88, 2], [-21, -113, -67, -17, -39, -177], [-124, -40, 57], [73, -171, -187], [70, 37, 45, -160, -78], [-48, 44, -59, -75, -63, -77]]
[A]: [52, 39, 95, 2, -17, 57, 73, 70, 44]


[Q]: [[-8, 77], [36, 58]]
[A]: [77, 58]


[Q]: [[-134, -25, -31, -108, -102, -196, 58], [-64, -182, -150, -47, -66], [-13, -117, 59], [-125, -132, 93, -141, -125], [15, -62, -49, 7, 63], [-17, 74, 99], [-101, 80], [75, 99]]
[A]:
[58, -47, 59, 93, 63, 99, 80, 99]