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: [[-106, 56, 90, 76, 6, -169], [-10, -187, 27, 59, 94, 85]]

A: [90, 94]
****
Q: [[-6, -62], [-113, -61, -143, 51, -4, -120, -139], [-158, -24, 22, 71], [98, -148, 36, -108, -144], [-30, -122, -47], [26, 11, -59, -47, -95]]

A: [-6, 51, 71, 98, -30, 26]
****
Q: [[-122, -18], [-126, -168, -62], [-185, 20, -166, 59, -185, -181, -174], [-32, -105, 14, -182], [91, 95], [-12, -124, 4, -192, -101, -200, -69], [-49, -113, 94, 50], [23, -25], [92, -139, -21, -136]]

A:
[-18, -62, 59, 14, 95, 4, 94, 23, 92]
****