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]: [[-23, 87, 95, -187, -123], [31, 60, 34, -168], [-29, 31, -37], [-163, -122], [-99, 66], [84, 42, -124, 20, -1], [-4, -190, -150, -150, -49, -20, 17]]
[A]: [95, 60, 31, -122, 66, 84, 17]


[Q]: [[-194, -30, -77, -21], [35, 86], [-189, -19, 29, -169, -32, -38, -25], [100, -144, 85]]
[A]: [-21, 86, 29, 100]


[Q]: [[-197, 4, -131, 88, -197], [-180, -80, -52], [-47, -27], [-78, -133, -98, -199], [61, -32, -101, -58, -42], [-5, -165, -178, -49, -57, 82], [90, 0, 93, 58, 23, 99], [-22, -193, -9, -190], [81, -107, 69, -128, -170, 90]]
[A]:
[88, -52, -27, -78, 61, 82, 99, -9, 90]