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]: [[45, 77, -108, -15, -54], [-159, -32, -74, 20, -167, -25, -2], [-100, -19, -143, 78], [63, -90, -69, 69, -29], [-115, -56, 77, -78, 8, -111], [-194, -63, -141, 8, 24], [-56, -125, -5], [45, -68, -6, -196, 12]]
[A]: [77, 20, 78, 69, 77, 24, -5, 45]


[Q]: [[72, -110, 97, -107], [-183, 45, -32, -7, -97, -142, -6], [-47, -104, 26, -34], [-113, -140, -200, -197, -42], [-65, 45], [44, -104], [27, -69], [-64, -42, -114]]
[A]: [97, 45, 26, -42, 45, 44, 27, -42]


[Q]: [[-177, -5, -148, -170, -110], [-111, 1, 94, -34], [-182, 65, -19, -52, -177], [-38, -182, -89], [71, -121, -146, 46, -136, -51, -154], [-114, -169], [-11, -76, 19, -179, -3]]
[A]:
[-5, 94, 65, -38, 71, -114, 19]