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]: [[57, 1, -116, -74, 72, -86], [-19, -44, -181, 89, -174, 39, 96], [-170, -82, -59, 83]]
[A]: [72, 96, 83]


[Q]: [[-161, -49, -6], [36, -84], [-53, 29, 2, -167, -111], [-163, -46], [-41, -91], [-71, 29, 35, -187, -53, -196, -66]]
[A]: [-6, 36, 29, -46, -41, 35]


[Q]: [[24, -36, -123, -160, -105], [-160, -106, -94, -95, -125, -82], [-186, -198, -9], [31, -40, 86, -51, -148, -91, 59], [-114, -4, 93], [-99, -6, -63], [28, -139, -32, -114], [-164, -175, 7, 51, 14, -127]]
[A]:
[24, -82, -9, 86, 93, -6, 28, 51]