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: [[-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: [[-160, -157, 75, 3, -119, 14, -70], [-156, 70, 10, 21], [-86, 47], [-52, 80, 87, 26, -100, 48], [-36, -127, 37, -1, -59, -26, 8], [72, 48], [-200, -178, -142, -12], [-5, -61], [76, -54, -134]]

A: [75, 70, 47, 87, 37, 72, -12, -5, 76]
****
Q: [[91, 35], [-166, -50, 72], [-84, -194, -34, -60], [-113, -7, -138, 40, 71, -80, -60], [57, -73, 91, 51], [17, -134], [59, -30, 44], [-45, -190, -124]]

A:
[91, 72, -34, 71, 91, 17, 59, -45]
****