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]: [[-70, -63, 11, -65, -62], [41, -3, -20, -154, -13, 32, -116], [30, 90, -122, 12, 33], [72, -18, -151, -20, -177], [-85, 34, -87, 6, 20], [56, -153, -117, -101], [-59, 91, -123, -28, -60, -134], [-186, -162, -133]]
[A]: [11, 41, 90, 72, 34, 56, 91, -133]


[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]: [[33, -16, 34, -135], [65, -41, 53, -111, 50], [58, -55], [-90, -6, -61, -92, -114, 95, 5], [-150, -199], [-37, 21]]
[A]:
[34, 65, 58, 95, -150, 21]