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.
--------
Question: [[-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]]

Answer: [34, 39, 62, 66, 38, -85, -2, -53]


Question: [[59, -66, -98, -64, -117, -128, -189], [-170, -12], [-25, -110]]

Answer: [59, -12, -25]


Question: [[-73, -99, -149, -184, 98, 70, -22], [-184, 48, -185, -121, -102, 61, -183], [99, 7, -4], [-188, -199, -179, -105, -97]]

Answer:
[98, 61, 99, -97]