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]: [[-22, -69, -38, -9, -92, 36], [-169, -140, -163, 86], [10, -73, -36], [-124, 53, 81, -61, 65, -184, -170], [69, -177, -73], [-112, 41, -38], [91, 31, 85, -72, -93, -48, 66], [-73, -180, 34, 16, -175, -28]]
[A]: [36, 86, 10, 81, 69, 41, 91, 34]


[Q]: [[61, -157, 48], [29, 77, -102, -122, 50, 25, -186], [44, -84, -172, -97, -142], [-194, 62, -5, -145, 93]]
[A]: [61, 77, 44, 93]


[Q]: [[61, -169, -70, 12, 20, -145], [-68, -109, -73, -147, 31, -68, 60], [-64, 1, -163, 0, -45, -10], [90, -182, -141, -34], [-164, -16], [-7, -66, -195, -148, 96, 23], [-47, 18, 55], [50, 5, -47, -17, -54]]
[A]:
[61, 60, 1, 90, -16, 96, 55, 50]