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: [[-29, 35, -38, -160, -138], [-179, -69], [-171, -170, -136, -81], [78, -45, 92], [-6, 91, -167, -63, -193, 69], [58, 42], [-152, -58, -89, -148, 48], [-81, -41, -193, -127]]

A: [35, -69, -81, 92, 91, 58, 48, -41]
****
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: [[-127, -198], [-79, -3, 61, -150], [-20, -44, -78, -133, -20, 16], [-71, -148]]

A:
[-127, 61, 16, -71]
****