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: [[-110, -122, -29], [-125, 57, 69], [1, -181, -129, -60, -67], [-172, -26, -65, -102, -124, 54], [52, -39, -177]]

A: [-29, 69, 1, 54, 52]
****
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: [[-168, -44], [96, 18, 92, -151, 83, 32, -49], [-135, -115, -3, 100, -25], [72, -163, -80], [-56, -41, -91, 95, 75, 39], [-173, -101, 63, -77, 79, 11, -45]]

A:
[-44, 96, 100, 72, 95, 79]
****