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]: [[-15, 9, -181, -172, -74], [-164, -77, 1, -65, 29, -113, -163], [-189, -106, 22, -40, -50, -48], [-77, -61, 16, 85, 36, -45, -26], [2, 77, -77], [-146, -87, 75, -163, -147]]
[A]: [9, 29, 22, 85, 77, 75]


[Q]: [[-146, -25, 45, 27, -147, 87, -107], [-103, -192, 83, -99, -30, -26, -97], [41, -106, -106, -66, -127], [34, -32, -46, 73], [-77, -143, -28, -166, -22], [48, -123, -70, 48, -170, -64, 49]]
[A]:
[87, 83, 41, 73, -22, 49]