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]: [[52, -128, -179, -149, 20, -143], [-174, -30, -84, -103, 39, -123, -85], [-52, 86, -77, 10, 58, -150, 95], [-165, -32, -190, -88, 2], [-21, -113, -67, -17, -39, -177], [-124, -40, 57], [73, -171, -187], [70, 37, 45, -160, -78], [-48, 44, -59, -75, -63, -77]]
[A]: [52, 39, 95, 2, -17, 57, 73, 70, 44]


[Q]: [[-196, -196, 25, 40, -134], [-145, -61, -176, -9], [-19, -7, 45, -32, -80, -26, -152], [-25, -133], [-163, 24, -71, -184, -59, 54], [-22, -199, -146, -41, 76, 96], [-193, -160, -11]]
[A]:
[40, -9, 45, -25, 54, 96, -11]