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]: [[-100, -43, 9], [-4, -170, 48, -129, 49, 83], [41, -102, -98, 81], [27, -183, 93, 47, -13, 51], [2, -61, -170, -73, 48], [2, -118, -152, -141], [-168, -73, -166], [15, 50, 32, 4]]
[A]: [9, 83, 81, 93, 48, 2, -73, 50]


[Q]: [[37, -149, 70, -32, -45, -159], [-144, -48], [-19, -130, -128, -154, -55, -183, -44]]
[A]: [70, -48, -19]


[Q]: [[-78, 6], [-56, 77, -15, -165, -147, -73, -65], [-35, -44], [-192, -49, 83, -19, -151], [-77, 51], [-150, -196, -3, -187, -172, 66, -175], [-61, -48, -48, -123, -7], [79, -76, -133, 15], [-179, -12, -108]]
[A]:
[6, 77, -35, 83, 51, 66, -7, 79, -12]