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]: [[-179, -61], [-68, -169, -177], [-103, -165], [-12, 40, -44, 97]]
[A]: [-61, -68, -103, 97]


[Q]: [[-101, -84, 47, -147], [-117, -82, -152, -159, 40]]
[A]: [47, 40]


[Q]: [[72, -136, -170, 31], [28, -167, -162, 80, -192], [55, -29, -182, 2], [-176, -77], [-90, -37, 61, -75, 22, -68], [-13, 71], [-140, 32, 81], [-140, 35, -2, 58, -188, 64, -170], [-105, -159]]
[A]:
[72, 80, 55, -77, 61, 71, 81, 64, -105]