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]: [[99, 11, 61, -95], [-186, -124, -20, -125], [-50, 93, -17], [-165, 56, 52, -142], [-88, -46, -178, -37, -126, 24], [84, 100, 18, 71, -135, 44, 96]]
[A]: [99, -20, 93, 56, 24, 100]


[Q]: [[-149, -37, 36, -154, -65, 62, 57], [84, -123, 60, -42], [96, -160, -59, -77, 14]]
[A]: [62, 84, 96]


[Q]: [[80, -47], [-126, -26, -146], [-31, 20, -25, 42, 32, -146, -45], [76, -113, 53, -184, -8, 86], [-37, -69, -17, -193], [-4, -50], [15, -102, -59, 33, -41]]
[A]:
[80, -26, 42, 86, -17, -4, 33]