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]: [[-88, -51, -196, 52, 31], [-40, -25, -38, -72], [-113, 74], [-1, 91, -198], [52, -61, -60], [-30, 70, -10, 98, -62, -60, -37], [-64, -40, -59, -13, -94, -57], [-194, -70, 95, 81, 7, 47]]
[A]: [52, -25, 74, 91, 52, 98, -13, 95]


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


[Q]: [[21, 71, -103, -69, -95], [-139, -151, 75, 98, -197], [-6, -136], [-77, -160, -158, -182], [-193, -24, -49]]
[A]:
[71, 98, -6, -77, -24]