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]: [[68, 82, -140, -80, -74, -135], [-154, -62, -78], [5, -153, -4, -88], [98, -78, 78], [57, -145, -49, -22, -67, 100], [-40, -152, 56, 49, -93, -138, 48], [-168, -137, 64, -103, -117], [-38, 2, -126, -106, -192, -160, 54]]
[A]: [82, -62, 5, 98, 100, 56, 64, 54]


[Q]: [[-136, 95, 65, -186, 5, 66, -28], [58, -34, -115, -148, 35], [-50, -167, -1, -64, -98, 72], [-169, -19, 99, 25, -55, 93, 37], [80, -153, -95, -95, -179], [62, 89, 79, -200, -13, -171, -153], [-61, -18], [-157, -25]]
[A]: [95, 58, 72, 99, 80, 89, -18, -25]


[Q]: [[-106, 70, 41, 48, 20, -133, -149], [70, -19, 65, -4]]
[A]:
[70, 70]