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]: [[47, -65, -11, 25, -17], [-93, -195, -89, 27, -81, -190], [-59, -20, -10, 93, -93], [-130, -31, 67, -36, -18, -125], [54, 100, -27, -38, -154, -96], [-148, 23, 70, -162, -145], [-83, -95, -44, 11, -155], [-43, -195, -94, -5], [-17, -99, -23, -176]]
[A]: [47, 27, 93, 67, 100, 70, 11, -5, -17]


[Q]: [[-65, -80], [-56, -98, 43, -194], [-152, -199, -81, -153, -164, -184, 97]]
[A]: [-65, 43, 97]


[Q]: [[-147, 42, -22], [81, 75, -56, -134, 7], [-140, 95, -58], [-90, -61, -81, 67, 99, -145], [-57, -197], [34, 69, -94, -160, 46, -173], [75, 59, 76]]
[A]:
[42, 81, 95, 99, -57, 69, 76]