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]: [[-50, 43, 3], [53, -199, 72, -60], [-135, 10, -186, -112], [92, -118, 88, -13, -183, -152, -20], [-173, -114, 85, -130, -153], [-186, -104], [-153, -52, -33, 41, -117, 16, -188], [-77, -47, -26, 19, -93]]
[A]: [43, 72, 10, 92, 85, -104, 41, 19]


[Q]: [[-35, 83, -145, -47, -160, -105], [-174, -29, 64, -182, 87, 53, -148], [8, -178, 46, 54], [-46, -140, -18], [-42, 51, -72], [-61, -17, -13, -52, -161]]
[A]: [83, 87, 54, -18, 51, -13]


[Q]: [[1, 42], [19, 56, -142], [-159, -135], [-170, 37], [8, 20, 62, -181, -58, -171], [-81, -48], [-53, -24, -181, -109, -184, -196], [-172, -185, 25]]
[A]:
[42, 56, -135, 37, 62, -48, -24, 25]