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]: [[89, 48, 81, 67, 22, 14], [-78, 84]]
[A]: [89, 84]


[Q]: [[57, -140, -88, -200, -81, 0], [-17, -81], [-64, -151, -32, -36, 58, 27, -86], [-142, -121, -92, 0, 53, -73], [-21, 51, -25], [63, 88, 25, 10], [-95, -148, 25, -161, -168, -76], [2, -111, -15, -79, 61], [-44, 12, -135, -7, 73, -84, -144]]
[A]: [57, -17, 58, 53, 51, 88, 25, 61, 73]


[Q]: [[-86, 41, -168, 3, -88, 93, -152], [88, -107, -135, -57, 44, -120], [6, -62, 2, -96, -149, -94], [-43, -184, 57, -17, -9], [34, -108, -87]]
[A]:
[93, 88, 6, 57, 34]