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]: [[-19, -186, -36], [-137, 15], [-194, -73, -48, -110, 24], [-3, -6, -4, 28, 84], [-195, -138], [76, -1]]
[A]: [-19, 15, 24, 84, -138, 76]


[Q]: [[-88, -78, -21], [-154, -184, -116, -32, -111, -121], [-14, -137, -43, -117], [-75, 38, -76, -138, -108, -102, 42], [12, -66, -91, 100, -55, 2]]
[A]: [-21, -32, -14, 42, 100]


[Q]: [[8, -200, -50, -99, -199, -73, -44], [-104, 13, 74], [69, 7], [-118, -195, 6, -179], [-44, -128]]
[A]:
[8, 74, 69, 6, -44]