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]: [[70, -85, -168, -181, -49, -105], [-178, -54, -86, -113, -16], [1, 51, -127, -18], [-61, 80, -64], [-45, -175, -125], [-138, -96, -112, -14, -77, -188], [84, -96, 32, -165], [-125, -42, 88, 4, 60, -122, 89], [49, -84]]
[A]: [70, -16, 51, 80, -45, -14, 84, 89, 49]


[Q]: [[-44, -145, 83, -107, -25], [-86, 59, -176, 37, 50, 36, -129], [-22, 55, 65, 57, -9], [56, -191], [83, -160, 43], [-59, 76, -121, -152, 99, -87, 93], [-152, -119, 98, -89, -180], [-79, -11, 11, -44, 15, -180, -121], [24, -33, -179, -111, 82]]
[A]: [83, 59, 65, 56, 83, 99, 98, 15, 82]


[Q]: [[-193, -135, -52, -16, 34, 94], [-141, -59, 95, -114, -45], [63, -34, 22, -199], [41, -176], [9, -174, 37, 53, -118], [-21, 42, 57, -142, -20], [-116, -172, 93, -193], [72, -127, 3, 60, -63, -25]]
[A]:
[94, 95, 63, 41, 53, 57, 93, 72]