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]: [[78, -23, -113, -137, 21, 71], [-195, 80], [-169, 20, 35, -101, 91, -78], [-174, 31, -169, -18, -159, 99, -7]]
[A]: [78, 80, 91, 99]


[Q]: [[-6, 83, -124, 9, -190, 76, -8], [48, -10, -88, -125], [5, -33, -85, 83, 31, 4, -125], [53, -95, 41], [-28, -75, -55, 35], [-103, -190]]
[A]: [83, 48, 83, 53, 35, -103]


[Q]: [[25, -173, 17, 40, 58], [-153, -198, -63, -154, 62, -101, -18]]
[A]:
[58, 62]