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]: [[32, 6, -107, -152, -73, -30], [-124, 26, -37], [21, -149, 19, -37, 72, -200], [-170, 53, 39, 0, -4, 31, -48], [49, 47, -77, 58, -75, -55, 75], [-68, 58], [-35, -170, 92, -167, -5], [-35, 44, -78, 32, -58, -31, 19]]
[A]: [32, 26, 72, 53, 75, 58, 92, 44]


[Q]: [[-103, 16, -53, -29, -31, -137, -190], [-87, -195, -34, 13], [97, -68], [-67, 8, -100, -197, 19], [-76, 36, 24, -166, 20, 11], [-173, 10], [60, 8, -56]]
[A]: [16, 13, 97, 19, 36, 10, 60]


[Q]: [[-2, 65], [-33, -150, -16, -99], [-74, -55, 33, 17, -110, 79], [-162, 94, -102, -34, 46, -83, -37]]
[A]:
[65, -16, 79, 94]