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]: [[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]: [[76, -83, -46], [3, 41, -151, -14, -59], [73, 90, -134, 22], [1, -181, -112, -177, 32, -93], [-142, -184, 39, -5]]
[A]: [76, 41, 90, 32, 39]


[Q]: [[-16, -80], [23, -142, -53, -12, 40, -44, 26], [-90, -168], [-163, 72, 92, -56]]
[A]:
[-16, 40, -90, 92]