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: [[-21, -117, 34], [-98, -30], [-138, 37, -165], [31, 55, -180, -96], [-5, 85, -58], [-180, 61]]

A: [34, -30, 37, 55, 85, 61]
****
Q: [[68, -104, -68, 40, -61, -144], [-98, -149, 64, -94, -183, -142, -73], [14, -7], [-194, 71]]

A:
[68, 64, 14, 71]
****