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]: [[-73, 37, -21, -114, -70, -143, -15], [-28, -38, 32, -102], [-192, -47, 34, -51, -69, 1, -118], [-161, -3, -23], [-176, -187, 97, -134], [97, -175], [61, -159, -108, -179, 68]]
[A]: [37, 32, 34, -3, 97, 97, 68]


[Q]: [[-179, -61], [-68, -169, -177], [-103, -165], [-12, 40, -44, 97]]
[A]: [-61, -68, -103, 97]


[Q]: [[-170, 77, 6, 36], [-99, -32], [-80, -139, -135, -6, -146, -11], [20, 0, 54, 88, -47, 78, -80], [-107, -197, -6, -177, -103], [-96, -65, -54], [-184, 60, 0]]
[A]:
[77, -32, -6, 88, -6, -54, 60]