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]: [[75, -65, 73, -136, -118], [51, -185], [-115, -90, 10], [53, -191, -159, -180], [-94, -98, -180, -43], [-159, 17, -78, -186], [-198, -111]]
[A]: [75, 51, 10, 53, -43, 17, -111]


[Q]: [[100, 3, -8, -15, -181, 25, -122], [-183, -120], [-95, -183, -94], [-34, -100, -172, 63, -139, -136], [-175, -113, -104, 50], [-170, -139], [-159, 80, 29, -100, -142, -108, -36], [56, -11], [-120, -109, -28, 88, -145, -92]]
[A]: [100, -120, -94, 63, 50, -139, 80, 56, 88]


[Q]: [[-21, -147, -192, -96], [55, 94, -72, -144], [-15, -178, 2], [55, -10, -20, 76], [12, -90, -22, -13, -148], [-138, -171], [24, -68, -103, -184]]
[A]:
[-21, 94, 2, 76, 12, -138, 24]