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]: [[-16, -4, -100, -51, 2], [32, 53, 72, -32, 24], [6, 60, -111, -198, -123]]
[A]: [2, 72, 60]


[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]: [[-186, -35, -200, -63, -157, -32], [-188, -104, -88, -96, 92], [66, 14, -133], [-174, 75], [-158, -70, -179, -173, -94, 72, 6], [-170, -58, 0], [-111, -142], [2, -197], [68, 96, -188, 89, -140, 46]]
[A]:
[-32, 92, 66, 75, 72, 0, -111, 2, 96]