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]: [[18, -95, -165, -171, -117], [62, -61, -196, -59, 84], [-83, -159], [-11, -65, -188, -27, 96, 88, -70], [-136, -91, -52], [-6, -118, 90, -192], [-179, 36, 76]]
[A]: [18, 84, -83, 96, -52, 90, 76]


[Q]: [[99, -189, -117, -151, 99, -174, 87], [-164, 68, -7, -84, 43, -199], [-62, -198, -32]]
[A]: [99, 68, -32]


[Q]: [[-36, -74, 24, -99, -93], [-2, 53, 68, 17, -198, -101, -188], [-110, -128, -155, -41, -25, -109, -72], [-39, -171], [-19, -89, -66, -67, -113, -58], [83, 31], [-187, 79, -181]]
[A]:
[24, 68, -25, -39, -19, 83, 79]