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: [[44, 44, 75, -181, 49, -30], [-102, -76, -66, 57, -83, -162], [-40, -167, 21, -29, 75, -195], [20, -158], [-125, -95], [8, -148, -4, 20, 9, -188, -157]]

A: [75, 57, 75, 20, -95, 20]
****
Q: [[-149, -37, 36, -154, -65, 62, 57], [84, -123, 60, -42], [96, -160, -59, -77, 14]]

A: [62, 84, 96]
****
Q: [[-61, -41, -23, -134], [-105, -171], [-7, 60, -173, 11], [-133, -149, -134, -59], [-27, 85, -157, -31]]

A:
[-23, -105, 60, -59, 85]
****