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]: [[-129, -163, 91, 74, -11, -30, -197], [-55, -146, 3, -187], [31, -111, 49, -80], [-6, -162, 70, -24, -150], [46, 61, -2, 91, 5]]
[A]: [91, 3, 49, 70, 91]


[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]


[Q]: [[-182, -146, 50, -99, -110, -55], [47, 0, 35], [86, 62, 64, -111, 50, -150], [41, -74, -195, -6, 22], [-100, -60, -26, 58, 36, 60, 97], [-145, -146, 18, -187, -83, -188]]
[A]:
[50, 47, 86, 41, 97, 18]