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]: [[37, 63, 24, -49, -66, 81], [-36, -61, -108], [35, -115], [-24, -143, 65, -63], [-104, 59, -120, -187, 27, -102, 36], [-105, -31, -128, -167, -109], [32, -148, -76, 33, -190, -89], [47, -56, 89, -35, -137, -2, 43], [98, 11, 48, -66, -84, -60]]
[A]: [81, -36, 35, 65, 59, -31, 33, 89, 98]


[Q]: [[90, -119, -109], [-43, -4, -156, -53], [-76, -171, 18, -56, -146]]
[A]: [90, -4, 18]


[Q]: [[14, -89, -123, -118, 59, -178, -98], [-144, -14]]
[A]:
[59, -14]