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]: [[-110, -122, -29], [-125, 57, 69], [1, -181, -129, -60, -67], [-172, -26, -65, -102, -124, 54], [52, -39, -177]]
[A]: [-29, 69, 1, 54, 52]


[Q]: [[-101, -168], [17, 42, -110, 20], [83, -36]]
[A]: [-101, 42, 83]


[Q]: [[-149, -71, -112, -67], [-101, -141, 77, -180, -157, -62, 61], [-135, -143, -133, -12, 21, -185, -96], [-93, -52, -151, -39, 68], [59, -69, -59], [97, -42, 65], [-176, 18, -178, -93, -3]]
[A]:
[-67, 77, 21, 68, 59, 97, 18]