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]: [[-95, -68, -90, -106], [-7, -42, -177, 75, 14, -98, 19], [-10, -36], [6, 31, 55, -25, -19], [-20, -159, 89], [-70, 94, -66, -9, -34, -26, 51], [-12, 38, 23, 52, -196], [-103, 22, -32, -188, -4, -15, -108], [96, -125]]
[A]: [-68, 75, -10, 55, 89, 94, 52, 22, 96]


[Q]: [[-26, -118, -136, -177, -61, -195, -191], [-118, -3, -34, -155, -125]]
[A]: [-26, -3]


[Q]: [[-98, -195, -36, 54, 34], [-54, -150], [-153, 61, -165, -90, 15, 4, 86], [27, -18, -16], [18, 75], [91, -36], [-74, 53, 23, -155, -77, -160], [-106, 81, -123]]
[A]:
[54, -54, 86, 27, 75, 91, 53, 81]