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]: [[98, -19, 52, 95, -164, 7], [-95, -171, 56, -150, -169, -116], [93, -89], [13, -56], [-93, 28, -3, -74], [59, -28, -111, -174], [-110, -135, 74, -109]]
[A]: [98, 56, 93, 13, 28, 59, 74]


[Q]: [[86, -199], [-148, -11, -34, -90, 76, -18], [-100, -108], [-79, -3, -49, 99, -130, -45], [27, -26, -37, -37, -100, -132, -169], [-160, -115, -48, -107]]
[A]: [86, 76, -100, 99, 27, -48]


[Q]: [[-58, -168, -64], [3, -49, -152, -131, 33, -126], [-158, -80]]
[A]:
[-58, 33, -80]