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]: [[-73, 37, -21, -114, -70, -143, -15], [-28, -38, 32, -102], [-192, -47, 34, -51, -69, 1, -118], [-161, -3, -23], [-176, -187, 97, -134], [97, -175], [61, -159, -108, -179, 68]]
[A]: [37, 32, 34, -3, 97, 97, 68]


[Q]: [[38, -34, 24, 52, -11, 5], [-79, -185, 72, -181, 76], [-87, 25, 70, -182], [-10, 93, -144], [-96, -18, -23, 26, -100], [-79, 41, 99, -121, -68, -11], [-133, -37, -58, 12, -84, -79], [93, 94, -160, -81, -128, -122, -42]]
[A]: [52, 76, 70, 93, 26, 99, 12, 94]


[Q]: [[27, 17, -43], [-163, -81, 2], [-71, -96, -116, 57], [95, -152, -104, 78, -58, -118], [-96, -30, -114, 27, -55], [-49, 28, -157, -4, -65], [-122, -129, 41, 54, -176], [80, -71, -29, 17]]
[A]:
[27, 2, 57, 95, 27, 28, 54, 80]