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]: [[-7, 38, 91, -146, -16, -169], [48, -155, 86, -44, 100, -92, 31], [-114, -7, -28, 51, 86, -4, 76], [84, 82, 71], [13, 2], [22, 53, -152], [-32, -137, -157], [-55, 14, -129, -58, 54, -10]]
[A]: [91, 100, 86, 84, 13, 53, -32, 54]


[Q]: [[-198, -26], [-126, -188], [-169, 5, -181, 23, -158], [-175, 64, -109, -107, 95, 44, -7], [-118, -66, 100, 24], [13, -90]]
[A]: [-26, -126, 23, 95, 100, 13]


[Q]: [[-194, 89, 77], [-185, -100, -134, -155], [-13, 98, 95, -4, -150, -158, -92], [37, -134, -113, -188, -13, 34, -1], [-85, 67, -41, -88, -169], [-105, 23, -97], [26, -83], [-6, -67, 1, -30, -54], [-52, -73, 37, -183]]
[A]:
[89, -100, 98, 37, 67, 23, 26, 1, 37]