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: [[-126, 66, -167, -175, 82, -189, -27], [-162, -53], [14, -57, 34, -143, -103], [-157, -175, -50, -40, 100, -16], [-34, 65, -158, 54], [57, 57], [-3, -47, 65], [-55, -145, -109, -124, -27, -181, 58], [-101, -147]]

A: [82, -53, 34, 100, 65, 57, 65, 58, -101]
****
Q: [[-23, 46, 40, -162, -97], [0, 78, -38, -80], [1, 79, 15, -7, -40, -88], [-117, -22], [96, -80, 62]]

A: [46, 78, 79, -22, 96]
****
Q: [[-28, 11], [41, -46, 81, 95], [-188, 25, -32, -195], [-32, 18, -155]]

A:
[11, 95, 25, 18]
****