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]: [[-58, 41, -14, -59, -168, -150, 61], [-110, -158, 28], [-109, 5, -79, -55, 95, -140], [8, -194, 9, -19, -121]]
[A]: [61, 28, 95, 9]


[Q]: [[-23, 34], [-9, -35, 39, -132, -43], [-195, 62, -128, -159, 62, -122, -109], [-98, 66, 28], [-48, 38], [-85, -91, -181, -129], [-125, -140, -162, -66, -2], [-196, -53, -117]]
[A]: [34, 39, 62, 66, 38, -85, -2, -53]


[Q]: [[-50, -18, -145, -32, -29], [4, -178, 66, -22], [63, 23, -65, -107, -132, -149, 2], [-71, 34, 66, 52, 3], [-19, 58, 40, -106, 54, 42], [-70, -143, -194, -142, 10], [75, -106, 79, 49, 50]]
[A]:
[-18, 66, 63, 66, 58, 10, 79]