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]: [[-62, 3, -118, -146, 75, -150], [3, -126, 64, -23], [64, 28], [-90, 57, 97, -92, -179]]
[A]: [75, 64, 64, 97]


[Q]: [[84, -86, 87, -13, 3, -132, 58], [41, -141, -89], [45, 53, 6, -87]]
[A]: [87, 41, 53]


[Q]: [[-67, 20, 17, -47, -3, 39, -80], [-176, 29, 70, -10], [73, -99, -197, -196, -152], [-112, 12, 0, 18, 19, -149], [11, -192, 35, 55], [50, -20, -192, -158, -10]]
[A]:
[39, 70, 73, 19, 55, 50]