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, -195, -66], [-6, -45, -30, -34, -43], [91, -127, -170, 11], [-127, 69, -126, -88], [-195, -24, -70, -91], [72, -1, -139, -122, -189]]
[A]: [-66, -6, 91, 69, -24, 72]


[Q]: [[-115, -177, 49, -176, -199], [2, 68, -35, 54, 43, -130]]
[A]: [49, 68]


[Q]: [[-164, -104, -48, 51], [2, -56, -7, -170, -93, -85], [-114, -7, 54, 99, -112, 13, 58], [44, 46, -12], [-184, -10, -11, 40], [-170, -172], [-183, 53, -43, -48], [68, 23, 27, -64, 88, -65], [76, 32, -78, -179, -157, -148, 43]]
[A]:
[51, 2, 99, 46, 40, -170, 53, 88, 76]