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]: [[4, 27, 7, 92, -49], [-198, 59, -131, -73], [-130, -48, -135, 58], [57, -189, -99, 66, 51, 1], [90, 55, -174, -161, -148, -181]]
[A]: [92, 59, 58, 66, 90]


[Q]: [[-92, -7], [1, -45], [53, -66, 54, -79, 17, -157, -142], [-9, -143, 9, -59], [-14, -179, -102, -29, -37], [-122, -171, -56, 94], [14, -199], [-83, -87]]
[A]: [-7, 1, 54, 9, -14, 94, 14, -83]


[Q]: [[-192, 23, -152, 90], [88, -124, 86, -93], [-123, -9, -186, -80, -145, 47, -87], [-142, -164, 22, -111, 33, -123], [19, 47, 67, -29, 58], [-91, 64, -120, -25]]
[A]:
[90, 88, 47, 33, 67, 64]