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]: [[-2, -170, -178, -115], [52, 57, -200, -86, 14, 31, -19], [-121, 20, -2, -173, -85, -115, 97], [30, -119, -33], [-40, -53, 24, -133, -196]]
[A]: [-2, 57, 97, 30, 24]


[Q]: [[55, -93, -37, 78, -196, -158, 53], [-56, -98], [-196, -173, -80], [89, -61, 79, -26, -155], [-157, -161, -158, -112], [-5, -198, -158, -81, 49, -108, 33], [-93, -117, -190, -105], [-71, 91, 87, -117], [-178, -94, -127]]
[A]: [78, -56, -80, 89, -112, 49, -93, 91, -94]


[Q]: [[-6, -5], [-96, 64, 65, 96, -105, -23, 75], [64, 47, -112, -133, 65], [-177, -5, -198, -19, 53], [48, -61, 68, -127]]
[A]:
[-5, 96, 65, 53, 68]