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]: [[-145, -140, -7, -47, -28, -158], [-15, -2, 91, 64, 43, -22, -33], [-165, 31, -25, 46, -178, -168, 93], [-146, -51, 86], [-107, 39, -154, -156, -33], [-89, -36, -35, -106], [-21, 28, -165, 23, -81, 74, -138], [-45, -28, 72, -140, -87], [17, -83]]
[A]: [-7, 91, 93, 86, 39, -35, 74, 72, 17]


[Q]: [[72, 43, 37, -195], [-123, -22, -117, -33, 67, 77, -163], [-198, -176, -16, 22, 44, 74, -90], [-10, -191, 5, 24, -69], [-168, -177], [-8, -173, -17], [-195, -46, 64, 15], [0, 59, -25, -95, -22], [45, -104, -59, -136]]
[A]: [72, 77, 74, 24, -168, -8, 64, 59, 45]


[Q]: [[-24, 37, -32, 80, -40, 52], [60, -125], [-171, -180, 81], [-89, 70], [-172, 93, -158, -152], [-75, 19, 28, -23], [89, 48, -14], [5, -41, -91, -161, -26], [-162, -167, -172, 59]]
[A]:
[80, 60, 81, 70, 93, 28, 89, 5, 59]