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]: [[97, -63, -64, -183, 95, -144], [-60, 44, -72, 31, -170, 88], [-127, 4, 73, -124, -186], [59, -117, -13, -186], [9, 39], [-174, 92, 4, -67, -112], [78, -107], [48, -75, 13, -184, -140, -104]]
[A]: [97, 88, 73, 59, 39, 92, 78, 48]


[Q]: [[-190, -118, 52], [-118, -139, -176, 7, -164, -105, 8], [23, -133], [-158, 54, -118, -120], [-162, -147], [-154, -102, -134, -142, -141, -127, 61], [25, 7], [-151, -160, -44], [92, -66, -39, -131, -53, -166, 30]]
[A]: [52, 8, 23, 54, -147, 61, 25, -44, 92]


[Q]: [[-113, -122, -11, -51, -147, -7], [82, -141, 70, 85], [-133, 4, -144], [-164, -4, -1, 7, -130, 7, -104], [-40, -86, -196, 47, -65, 72], [-94, 24, 69, 31, -105, -22, -121], [-130, -171, 10, -104, -49]]
[A]:
[-7, 85, 4, 7, 72, 69, 10]