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: [[-134, -121, 72, 82, -12, -28], [67, 87, 98, -58, -57, 6, 84], [-46, 76, -179, 21, -132, -46], [12, -67, -19, -46], [-62, -22, 58, -139, -39, -118], [-5, -170, 85, -75, -126, 53, -63], [9, -82, 7], [-88, -111, -81, 86, -17, 36, -160]]

A: [82, 98, 76, 12, 58, 85, 9, 86]
****
Q: [[-45, -46, -14, 23, -167], [30, -95, 45, 99, -182], [43, -36, 11, 54, -39], [-165, -7, 29, -105, -125, -8], [56, -161, 54, 25, -146, -46, 98], [-189, -185, 82, -122, 59, 95, 38], [65, -34, -10, -33, -35, -125, -50], [-4, 88, -121, -118, 10], [41, -131, -189, -168, -198, -58, 51]]

A: [23, 99, 54, 29, 98, 95, 65, 88, 51]
****
Q: [[-133, -176, -41, -30, -156], [-117, -66, 9, -161, -14]]

A:
[-30, 9]
****