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]: [[-153, -153, -77, 39], [6, -153, -68, -193, -39], [91, -51, -48], [-140, -7], [-165, 52], [-92, 91, 70, 99, -128, -191]]
[A]: [39, 6, 91, -7, 52, 99]


[Q]: [[-4, -186, 89, 50, 100, 24], [-135, -17, -4, 79, -42, -145], [-196, -130], [82, 74], [-187, 7, -164, -163, -109], [90, 76, -16, 13, 6, 89], [-89, 46]]
[A]: [100, 79, -130, 82, 7, 90, 46]


[Q]: [[-132, 87, 9, -146, -184], [97, -169, -21, 52, 16, -182, -6], [-60, -2, -147, 55], [-111, -154, -41, 37, -97, -139, -111], [33, -113, -106, -92], [-13, 49, 66, -121, 61, -129, -124], [72, -107, -192, 86]]
[A]:
[87, 97, 55, 37, 33, 66, 86]