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: [[-129, 67, 1, -129], [-35, -169, 26], [-125, 7, -53, -56], [-138, -51, -77, -16], [-139, -98, 78, 41], [-74, 46, 11, 79, -176, -89, -109], [4, -21, -101, -105, -99], [85, -182], [-105, 9, -122, -38, 35]]

A: [67, 26, 7, -16, 78, 79, 4, 85, 35]
****
Q: [[-64, -150, 1, 7, -71, -89, 54], [44, 34, -40], [40, -184, 50, -161, 38, -108], [-178, -136, -170, -59, -71, 12], [-80, -60, 24, -169, -1], [-145, -28, -63]]

A: [54, 44, 50, 12, 24, -28]
****
Q: [[-7, 72, 47, -99, -10, -18, -94], [-143, 34, -34, 8, -174, -16, 50], [28, -21, -139, -110], [-116, -195, -124, -112, 78], [31, -113], [-5, 34, -27, -154, -185, -195, -59]]

A:
[72, 50, 28, 78, 31, 34]
****