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]: [[-170, -186, -15], [-130, -93, -50, 88, -170], [-15, -144, -141], [-85, -104, -115]]
[A]: [-15, 88, -15, -85]


[Q]: [[-128, -182, 21, -87, -194, -165, -9], [-64, -106, -38, -182, -45, -81], [-49, -197, -76, 99, 91], [89, -158, -186, -149], [40, -165, -148, -52, -153, -159], [-61, -69, -139, -1, 23, 0, 46], [69, -133, -27, -135]]
[A]: [21, -38, 99, 89, 40, 46, 69]


[Q]: [[-120, -41, -68, -46, 46, -142, -78], [98, -161, -106, -60], [-102, -4, 8, -97, -176], [73, -103, -9, -72, -61, 48, -181], [-161, 20, 98, -149, -119, -82]]
[A]:
[46, 98, 8, 73, 98]