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: [[-7, 38, 91, -146, -16, -169], [48, -155, 86, -44, 100, -92, 31], [-114, -7, -28, 51, 86, -4, 76], [84, 82, 71], [13, 2], [22, 53, -152], [-32, -137, -157], [-55, 14, -129, -58, 54, -10]]

A: [91, 100, 86, 84, 13, 53, -32, 54]
****
Q: [[63, -79, 12], [88, -189, -45, -52, -184, -20], [80, -188, 33, -31, 87, 23, -179], [-151, -190, 30, -192, 46, -181, -60], [-137, -114, 22, -98], [32, -146, 71, -115, -67, -84, 19], [71, 75, -158, -7, -185, 91, 26], [16, -96]]

A:
[63, 88, 87, 46, 22, 71, 91, 16]
****