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]: [[-23, 46, -103, -74, 16], [-161, -180, 34, -156], [80, -153], [76, -198, -198, -126, 47, -59, -193], [-99, -78, -127, 68, 68, -194, -121]]
[A]: [46, 34, 80, 76, 68]


[Q]: [[-42, -152, -122, -79], [-85, 39, 36, -53], [83, 52], [-31, -2, -176, -152, -107, 44, 62], [10, -163, -16], [44, 33, 55, -59, 1, -30, -19]]
[A]: [-42, 39, 83, 62, 10, 55]


[Q]: [[-171, 39, 8], [-142, -49, 62, 27, 82, -108], [-146, 12, 39, -4, -118, -22], [-8, -147, 54, 92, -136]]
[A]:
[39, 82, 39, 92]