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: [[70, -85, -168, -181, -49, -105], [-178, -54, -86, -113, -16], [1, 51, -127, -18], [-61, 80, -64], [-45, -175, -125], [-138, -96, -112, -14, -77, -188], [84, -96, 32, -165], [-125, -42, 88, 4, 60, -122, 89], [49, -84]]

A: [70, -16, 51, 80, -45, -14, 84, 89, 49]
****
Q: [[-192, -183, 27, -64, -73, 59, -30], [-127, -95, 61, -80], [-129, -43, -148, 74]]

A: [59, 61, 74]
****
Q: [[31, 85, 38, -32, 69, 73, 17], [-51, 53, -138, -91, -154, -63, -53]]

A:
[85, 53]
****