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]: [[98, -52, -91, -43, -31], [-140, 30, -153, -111, 2, -127], [-45, 96, 67, 56, 72, 10], [87, -89], [-95, -164, -61, 63, 96, -105], [-75, -179, 22, 67, -98], [-121, -25, 53, -174]]
[A]: [98, 30, 96, 87, 96, 67, 53]


[Q]: [[31, 44], [13, -22, 72, 55, -34], [-27, 78, 59, 91, -145], [14, -162, -184, -161, -77, -168, -99], [-136, 28, 56, -45, 85], [-29, -101, 59, 6, 99, -113], [81, 42, -55]]
[A]: [44, 72, 91, 14, 85, 99, 81]


[Q]: [[-24, -199, 22, -69, 80], [-159, -33, 13, -178, -36, -24, 19], [-57, -177, 89, -137], [-194, -156, -50, -111], [-40, 96], [-188, 65, 34, -197, -171], [93, -52, -74, -143, -155]]
[A]:
[80, 19, 89, -50, 96, 65, 93]