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]: [[-145, -140, -7, -47, -28, -158], [-15, -2, 91, 64, 43, -22, -33], [-165, 31, -25, 46, -178, -168, 93], [-146, -51, 86], [-107, 39, -154, -156, -33], [-89, -36, -35, -106], [-21, 28, -165, 23, -81, 74, -138], [-45, -28, 72, -140, -87], [17, -83]]
[A]: [-7, 91, 93, 86, 39, -35, 74, 72, 17]


[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]: [[32, 1], [-147, -196, -16, 49, 6, -48, -24], [-17, -130, -3], [-154, 98, 57, -160, -19, 98, 37], [-98, -100, -30], [-63, 23, -65, -1, -63, -52], [-65, 71, -70], [64, 92, -167, -135, 22, 21, 32]]
[A]:
[32, 49, -3, 98, -30, 23, 71, 92]