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]: [[97, 4, -169, -58, 19], [-124, -24, 25, -83, -178], [-20, 45], [-181, 51], [-124, -113, -154, -181, -175], [-150, -93, -196, -56], [-69, 41], [-171, -40], [74, 19, -17]]
[A]: [97, 25, 45, 51, -113, -56, 41, -40, 74]


[Q]: [[-179, -61], [-68, -169, -177], [-103, -165], [-12, 40, -44, 97]]
[A]: [-61, -68, -103, 97]


[Q]: [[6, -79, 91, -90, 27, -177, 63], [-43, -180, 39, -147, -75, 63, 9], [-93, 46, -19, 4, -62], [59, 19, 92, -7, 81, 13, -178], [-50, 6, 95, -132, 96, -58], [90, -45], [97, 100, -124, 64, 97], [-112, 35, -70]]
[A]:
[91, 63, 46, 92, 96, 90, 100, 35]