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: [[-40, 4, -3, -194, -125], [95, 1, 18, -58, -130, -124, -150], [-128, 28, -80, -152, -186], [51, -199], [-75, -172, -90, -149, -142], [-137, 76, 47, 70], [-58, 64, 4, -194, -169, -16, -107], [9, -57]]

A: [4, 95, 28, 51, -75, 76, 64, 9]
****
Q: [[-30, -193, -89], [-195, 93, 69, -136, 37, 43, -88], [-199, -111, 41, 52, -150, 12]]

A:
[-30, 93, 52]
****