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: [[9, -188, -167, -47], [-72, -97, -152, -108, -49, -5], [-88, -84, 26, -11, -91, -46, 62], [-110, -35, -61, -141, -182], [52, 29, 92, -131, -121, -98, -35], [-30, -125, -175, -123, -45], [91, -16, -57]]

Answer: [9, -5, 62, -35, 92, -30, 91]


Question: [[-73, 37, -21, -114, -70, -143, -15], [-28, -38, 32, -102], [-192, -47, 34, -51, -69, 1, -118], [-161, -3, -23], [-176, -187, 97, -134], [97, -175], [61, -159, -108, -179, 68]]

Answer: [37, 32, 34, -3, 97, 97, 68]


Question: [[-155, -105, -49, -114, 78, -169], [-20, 10, 10], [-98, -183, 40, -68, -105], [-22, -99], [6, -73]]

Answer:
[78, 10, 40, -22, 6]