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]: [[-122, -130], [-22, 85, 73, -35], [-134, -96, 30], [49, -68, -166], [-75, -193, -193], [68, 50, -166, -111, -65, 25], [-109, 72, 22, -170, -106, -32, 66]]
[A]: [-122, 85, 30, 49, -75, 68, 72]


[Q]: [[-138, 20, 9, -133, -166, -153], [-71, -103], [-144, 9, -15, 2, -17, -172, -139], [97, -35, 16], [-77, -46, 46, -41, -12], [-166, -84, -193, 17, 12, -142], [-76, 90, -186]]
[A]: [20, -71, 9, 97, 46, 17, 90]


[Q]: [[-111, -91, -148], [-199, 54, -82], [-107, 99], [16, -163, -106], [80, -112, -14, -92, 52, -81, -150], [9, 37, -90, -179, 31, 22, 22], [-122, -143, -66, -15, -136]]
[A]:
[-91, 54, 99, 16, 80, 37, -15]