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]: [[40, -40, -148, -172], [-116, -46, 92, -51, -20], [-161, -93, 46, -56], [3, -153, 79, -38, 62, -57]]
[A]: [40, 92, 46, 79]


[Q]: [[85, -28, -180, -71, 2], [-115, -8, -40], [67, -109, -131, -27, -24, -119], [-16, 45, 25], [-135, -11, 29, -67, 71], [-66, -101, -181, -180, 91, -72, -153]]
[A]: [85, -8, 67, 45, 71, 91]


[Q]: [[-146, -76], [85, -150], [90, -16, -94, -49, -162, 48, -112]]
[A]:
[-76, 85, 90]