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]: [[-102, 46, -150, -150], [-151, -137]]
[A]: [46, -137]


[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]: [[-41, 38, 45, 47], [-57, 61, -149, -61, 24, -172], [-24, -18, -39, -115], [-90, 89], [65, -90, -177, -125, 76, -80, -126]]
[A]:
[47, 61, -18, 89, 76]