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]: [[-11, -151], [-190, -66, 69], [-25, -118, 63, 57, -157, -78, 79]]
[A]: [-11, 69, 79]


[Q]: [[-124, -72, 94], [40, -5, -15, -98, 79, -94, -45], [53, -40, -73, -117, -195, -50], [20, 51, -140], [-30, -112, 25, 35, 84], [-40, -135, -184, -159, -33, -59]]
[A]: [94, 79, 53, 51, 84, -33]


[Q]: [[-72, -146, 16, 8, -119], [-74, 17, -51, -60], [-161, 74, -38, -158, -58, -22, -113], [95, -43, 0, 46, -79, 60], [20, -84], [-13, 55, -51, -121], [78, -106, -51, -161, -102, -90, 11], [-30, -39, -86]]
[A]:
[16, 17, 74, 95, 20, 55, 78, -30]