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]: [[-126, 66, -167, -175, 82, -189, -27], [-162, -53], [14, -57, 34, -143, -103], [-157, -175, -50, -40, 100, -16], [-34, 65, -158, 54], [57, 57], [-3, -47, 65], [-55, -145, -109, -124, -27, -181, 58], [-101, -147]]
[A]: [82, -53, 34, 100, 65, 57, 65, 58, -101]


[Q]: [[-37, 85, -37, -156], [82, -161, -84, -172], [-126, -35, -39, -130, -200]]
[A]: [85, 82, -35]


[Q]: [[1, -24, 98], [-61, -165, -133, -127, 11, -133, 66], [-146, 76, -124, -17, -132, 31, 8], [-76, -4], [-111, -78, -51, -49, -131], [38, -114, 31]]
[A]:
[98, 66, 76, -4, -49, 38]