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: [[-79, -29, 95, 11, -47, -37], [-61, -14, 2, 63, 18, -44, 60], [67, -61, -152, -108, -184, 85], [-7, -135, -113, -81, -146, -34], [74, 58], [-139, 40, -181, -95], [83, -28, -200], [80, -130, -174, 36, 19], [12, 70, -198, -62]]

A: [95, 63, 85, -7, 74, 40, 83, 80, 70]
****
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: [[-97, -127, -44, 76, 78], [-77, -144, -107], [45, 50, 64, -85], [-1, -94, -111, -64, -194]]

A:
[78, -77, 64, -1]
****