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]: [[-42, -149, -6, -115, -152], [-59, -75], [-178, -94, 49, -51, 52], [-51, 7, -146, -101, -191, 14], [-132, -103, 96, -126, -195, 80], [37, 19, -145, -23, -109], [-109, -125, 47, 36, 6, -123, 62]]
[A]: [-6, -59, 52, 14, 96, 37, 62]


[Q]: [[-20, -163, -126, -26], [-7, -183], [1, 84, 39, -79, -79, -98], [13, 2, -5, 20, 98, 30, -4]]
[A]: [-20, -7, 84, 98]


[Q]: [[11, 61, 53], [-31, -81], [34, 63, -13, -61, 39, -162], [-20, 94, 65], [-174, 2, -110, -34], [-149, -127, -2, -49, -136, -103], [-71, -22, -28, 89, -178], [-114, -181]]
[A]:
[61, -31, 63, 94, 2, -2, 89, -114]