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: [[-49, -181, -26, -69], [-2, 61, -87, 2, -166, -161]]

A: [-26, 61]
****
Q: [[-15, -180, -24], [-18, -77], [-167, -37, -37], [97, 80], [-91, 18, -122, -8, 90, -125, -162], [96, 74, -57, 89, -171], [66, -113]]

A: [-15, -18, -37, 97, 90, 96, 66]
****
Q: [[-76, -71, -200, -199, -30, -93, -122], [-140, -129, 54, -138], [-5, -146, 71, -88, -65, -174, 1], [-49, -153, 19, 26], [18, 96, 24, 15], [57, -106, -60, -91, -117], [13, -137], [-29, 91, 59, -73, -29], [85, -5]]

A:
[-30, 54, 71, 26, 96, 57, 13, 91, 85]
****